CN1848148A - Fast command control method of battlefield guided missile firepower fast and high-hit rate-distribution - Google Patents

Abstract

The present invention relates to a quick command control method for battlefield missile firepower quick high bit rate distribution, belonging to military affairs and related field. The command-controlled object is all the battlefield missile firepower. Said method includes the following several steps: constructing command control model, using linear program method and dual program method of linear program to resolve said model and utilizing two-dimensional tabular form to continuously improve said resolved result so as to obtain the final command control scheme according with the battlefield missile firepower quick high bit rate distribution requirements.

Description

Quick commander's control method that the quick high hit rate of battle-field guided missile firepower distributes

Technical field the present invention relates to national defence and association area, is used for distributing enforcement fast to the quick high hit rate of battle-field guided missile firepower

Commander's control realizes the quick high hit rate of battle-field guided missile firepower is distributed.

Background technology is implemented commander's control that the quick high hit rate of guided missile firepower distributes between the emission side in battlefield and target side be an important component part of operational commanding control, according to length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is that target and the commander's controlling models with low computational complexity and high solvability are that the battlefield commander commands the key issue of controlling necessary solution fast to the quick high hit rate distribution of battle-field guided missile firepower enforcement, the solution of this problem is for increasing substantially fighting capacity, minimizing is to the demand of battle-field guided missile firepower, have crucial meaning, the length in missile flight path described here is meant that emission side from guided missile is to the geographic distance the target side of guided missile.

The firepower of guided missile is most important for the triumph of capturing IT-based warfare, complicated battlefield surroundings may impact the hit rate along the guided missile of a certain flight path, thereby reduce the hit rate of guided missile, and the guided missile that makes emission is more accurate, the commander of hit quickly control is the key that improves the firepower strike effect of guided missile, and wherein the matter of utmost importance that must solve is commander's control plan of the quick high hit rate distribution of guided missile firepower of formulation science.The quality of this plan, not only be related to and implement the quick high hit rate of battle-field guided missile firepower and distribute what of institute's consumption of natural resource, but also the guided missile that is related to emission can be accurately, hit in time, be unlikely to guarantee fighting capacity that flight because of the guided missile of emission expends time in, accuracy at target descends.

For the quick high hit rate of battle-field guided missile firepower distribute and commander's control of this guided missile Fire Distribution the time seem more important, constraint condition that therefore must be by reducing commander's controlling models, analyze the choose reasonable parameter by antithesis and improve solvability and expend time in or the no-hit probability minimum is come the quick high hit rate of battle-field guided missile firepower distributed as optimization aim and implemented commander's control fast with missile flight.

The present invention relates to quick commander's control method that the quick high hit rate of battle-field guided missile firepower distributes, relate to military affairs and association area, the object of commander's control is all battle-field guided missile firepower, this method is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meet the quick high hit rate of battle-field guided missile firepower until final acquisition and distribute the option control command that requires, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in quick commander's control that the quick high hit rate of all battle-field guided missile firepower distributes, the invention further relates to the technology that realizes this method.

Summary of the invention the present invention is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model, obtain with implementing to command the scheme of controlling two-dimentional form description the quick high hit rate of battle-field guided missile firepower is distributed, and check whether this option control command meets the guided missile no-hit probability of finishing the quick high hit rate allocating task of whole battle-field guided missile firepower and the requirement of flight time, if do not meet the demands, then by analysis to this two dimension commander control form, and according to shadow price, guided missile no-hit probability bottleneck, the time bottleneck is adjusted the accuracy at target of the launched a guided missile quantity of associated transmissions side and guided missile or flying speed etc., constantly repeat this and find the solution-check analytic process, meet the quick high hit rate of battle-field guided missile firepower until final acquisition and distribute the option control command that requires.Therefore, the conception of quick commander's control of the quick high hit rate distribution of battle-field guided missile firepower is proposed, introduce that missile flight expends time in and the analytical approach of no-hit probability, set up linear programming and the dual program model of seeking optimum option control command, come this model of rapid solving by reducing constraint condition, obtain with implementing to command the scheme of controlling two-dimentional form description the quick high hit rate of battle-field guided missile firepower is distributed, and according to guided missile no-hit probability and the time requirement of finishing whole MISSILE LAUNCHING task, by searching guided missile no-hit probability bottleneck and the time bottleneck that the quick high hit rate allocating task of whole battle-field guided missile firepower is finished in influence, the unreasonable configuration of the launched a guided missile quantity of emission side and the accuracy at target or the flying speed of guided missile adjusted, continue to optimize and improve this option control command, and final no-hit probability and the time requirement that obtains to satisfy the quick high hit rate distribution of battle-field guided missile firepower, option control command with two-dimentional form description becomes key character of the present invention.

The technical scheme of quick commander's control method that the quick high hit rate of battle-field guided missile firepower of the present invention distributes is:

At first, the quick high hit rate assignment problem of battle-field guided missile firepower is defined as by the emission side of guided missile and the emission goal systems that target side constituted of guided missile, the feature of this system can be used the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the launched a guided missile quantity of emission side and target side guided missile, the quantity of the speed of missile flight and guided missile salvo is described, and according to no-hit probability and time requirement to the battlefield MISSILE LAUNCHING, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model, obtain with implementing to command the scheme of controlling two-dimentional form description the quick high hit rate of battle-field guided missile firepower is distributed, no-hit probability bottleneck and time bottleneck by continuous searching emission goal systems, launched a guided missile quantity to relevant emission side is carried out reasonable disposition, adopt the methods such as guided missile of different accuracy at targets or flying speed, final no-hit probability and the time requirement that obtains to satisfy the quick high hit rate distribution of battle-field guided missile firepower, the quick high hit rate of battle-field guided missile firepower is distributed the scheme of implementing commander's control, finish commander's control that the quick high hit rate of battle-field guided missile firepower is distributed.

The quick commander that the quick high hit rate of battle-field guided missile firepower is distributed controls, the computational complexity and the needed computing time of finding the solution commander's linear programming of controlling models and dual program should not exerted an influence to the real-time of commander's control decision, therefore reducing unnecessary constraint condition is the important measures that improve commander's control decision real-time, for computational complexity that reduces commander's controlling models and the solvability that improves commander's controlling models, stipulate that the constraint condition relevant with target side is the constraint condition that equals the target side demand, the constraint condition relevant with emission side is to be not more than can the launch a guided missile constraint condition of quantity of emission side's maximum.

Complicated battlefield surroundings may impact the hit rate along the guided missile of a certain flight path, thereby reduce the hit rate of guided missile, for expending time in missile flight or the no-hit probability minimum is the commander control of target, this reduction has been equivalent to weaken the power of guided missile firepower, the guided missile no-hit probability can be with the function of time as variable, also can be and irrelevant constant of time, the no-hit probability of the guided missile of different flight paths can be different.

Find the solution commander's controlling models by the method for finding the solution linear programming and finding the solution the dual program of linear programming, minimum no-hit probability or the flight path of least consume time that different target side needs can obtain respectively to launch a guided missile from difference emission side, flight time, dependent probability, the shadow price relevant with different target side's constraint condition with different emission sides, the result that will find the solution inserts in a kind of two dimension commander's control form again, according to analysis to this two dimension commander control form, and pass through according to shadow price, no-hit probability bottleneck and time bottleneck are adjusted correlation parameter, constantly find the solution and update, meet the quick high hit rate of battle-field guided missile firepower until final acquisition and distribute the option control command that requires.

Can by the quantity of launching a guided missile to each target side from each emission side, size, no-hit probability, the quantity of guided missile salvo that each target side needs carrying capacity are described as the zones of different in the two-dimentional form of option control command, missile flight expends time in and relevant shadow price, the quantity that each emission can be launched a guided missile, residue can the launch a guided missile situation of change and the minimum no-hit probability of all guided missiles of relevant shadow price and emission and the minimum time that expends of quantity.

If the option control command of trying to achieve can not satisfy predetermined guided missile no-hit probability or the requirement of flight time, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence battle-field guided missile no-hit probability and the bottleneck of missile flight T.T., carry out reasonable disposition by the quantity that can launch a guided missile to emission again, increase the quantity of salvo batch and the means such as guided missile that adopt different accuracy at targets or flying speed, eliminate no-hit probability bottleneck and time bottleneck, and repeat this process, until the predetermined requirement that meets T.T. of the no-hit probability of the battle-field guided missile of emission and flight.

Quick commander's control method that the quick high hit rate of battle-field guided missile firepower of the present invention's design distributes is applicable to that it is key character of the present invention that the quick high hit rate of all battle-field guided missile firepower distributes.

With being analyzed as follows of no-hit probability minimum quick commander's control problem that to be target distribute the quick high hit rate of battle-field guided missile firepower, it is the analysis of target to quick commander's control problem of the quick high hit rate distribution of battle-field guided missile firepower that this analysis is equally applicable to the minimum that expends time in, and only need objective function this moment $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$ Be replaced into $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},$ With constraint condition D _jy _j+ S _iy _N+i≤ p _IjBe replaced into D _jy _j+ S _iy _N+i≤ d _IjAnd similarly analyze and get final product.

Supposing that the quick high hit rate assignment problem of battle-field guided missile firepower can be with launched a guided missile by m node and n as launching a guided missile the destination node of target and exist the network in a missile flight path to describe between different emissions and destination node, is x from launching the quantity that node i launches a guided missile to destination node j _Ij, the guided missile no-hit probability is p _Ij(t), the length of flight path is d _IjThe guided missile no-hit probability is meant that complicated battlefield surroundings may impact the hit rate along the guided missile of a certain flight path, thereby reduce the hit rate of guided missile, for expending time in missile flight or the no-hit probability minimum is the commander control of target, this reduction has been equivalent to weaken the power of guided missile firepower, the guided missile no-hit probability can be with the function of time as variable, also can be and irrelevant constant of time, is expressed as p _Ij, the no-hit probability of the guided missile of different flight paths can be different,

The problem that need to solve is one of design from m the node of launching a guided missile n the destination node of launching a guided missile, make all no-hit probabilitys of launching a guided missile be minimum, expend time in and satisfy the plan of launching a guided missile of pre-provisioning request simultaneously, and calculate each node of launching a guided missile required guided missile salvo quantity of launching a guided missile, relevant battle-field guided missile Fire Distribution commander's controlling models and linear programming equation are as follows:

Objective function: $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

The constraint condition of destination node guided missile demand: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}=D_j,(j=1,\·\·\·,n)$

The emission node can the amount of launching a guided missile constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}\≤S_i,(i=1,\·\·\·,m)$

Condition of Non-Negative Constrains: x _Ij〉=0, (i=1 ..., m; J=1 ..., n)

Emission node i (i=1 ... m) the quantity V of the guided missile salvo of Xu Yaoing _i:

Guided missile from emission node i (i=1 ... m) fly destination node j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish all spent minimum time of battle-field guided missile flight: minT=max{T _Ij}

With j the maximum guided missile no-hit probability that destination node is relevant: $p_j=\underset{p_{\mathrm{ij}}\∈P_{\mathrm{op}}}{\max }\left\{p_{\mathrm{ij}}\right\},j(j=1,\·\·\·n)$

Finish the guided missile no-hit probability of all battle-field guided missile emissions: min P=max{p _j, j (j=1 ... n)

With j the guided missile no-hit probability carrying capacity that destination node is relevant: $\min Z_j=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}},j(j=1,\·\·\·n)$

Total guided missile no-hit probability carrying capacity of battle-field guided missile emission: $\min Z=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}\min Z_j$

With j the guided missile carrying capacity that destination node is relevant: $Z_j=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},j(=1,\·\·\·n)$

The total guided missile carrying capacity in battlefield: $Z=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{Z}_j$

Wherein:

M is the sum of node of launching a guided missile;

N is the sum as the destination node of launching a guided missile;

P _OpBe commander's controlling models p by associated pathway when obtaining optimum solution _IjThe set of forming;

The value of objective function was called guided missile no-hit probability carrying capacity when minZ obtained optimum solution for commander's controlling models, and this value is the smaller the better;

p _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... n) the MISSILE LAUNCHING no-hit probability between can be with the function of time t as variable;

d _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... the length in the missile flight path n) (unit: kilometer);

V _iFor the node i that launches a guided missile (i=1 ... m) quantity of guided missile salvo;

L is the quantity of launching a guided missile (unit: piece) in each salvo;

C is the flying speed of launching a guided missile (unit: kilometer/hour) in each salvo;

S _iFor emission node i (i=1 ... m) quantity that can launch a guided missile (unit: piece);

D _jFor needs to destination node j (j=1 ... the quantity of n) launching a guided missile (unit: piece);

Above-mentioned model shows: objective function be equivalent to ask probability-weighted and, on the basis of trying to achieve guided missile no-hit probability carrying capacity minZ value by linear programming, can calculate the quantity x that each emission node must be launched a guided missile to the destination node of being correlated with _Ij, the p of associated pathway _Ij, according to the quantity L that in each salvo, launches a guided missile, can calculate the salvo quantity V that each destination node needs again _i, at last according to the flying speed C that launches a guided missile in the salvo and between emission and destination node the longest path of missile flight, can calculate the guided missile no-hit probability carrying capacity minZ of each destination node again _j, maximum guided missile no-hit probability p _jFinish the guided missile no-hit probability minP of whole MISSILE LAUNCHING task, the shortest time T that expends, thereby realize the commander that the quick high hit rate of battle-field guided missile firepower distributes is controlled, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:

Objective function: $\max G=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{D}_j{y}_j+\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{S}_i{y}_{n+i}$

Constraint condition: D _jy _j+ S _iy _N+i≤ p _Ij, (i=1 ..., m; J=1 ..., n)

Condition of Non-Negative Constrains: y _j, y _N+i〉=0, (i=1 ..., m; J=1 ..., n)

Wherein: y _j, y _N+iBe respectively the shadow price or the relevant decision variable of opportunity cost of the constraint condition relevant with emission node guided missile quantity with the target of former linear programming,

Since primal linear programming solves be with destination node j and emission node i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make destination node j and emission node i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y _jAnd y _N+iReflection make just destination node j and emission node i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the minimum guided missile no-hit probability delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.

Embodiment

Implementation example

In IT-based warfare, the quick high hit rate distribution capability of the battle-field guided missile firepower of combat troop is an important component part of its fighting capacity, to quick high hit rate distribution capability of huge battle-field guided missile firepower and the demand of guided missile firepower time, make commander's control of implementing the battle-field guided missile Fire Distribution become vital task, with the no-hit probability minimum is that the implementation example of quick commander's control of distributing of the quick high hit rate of the battle-field guided missile firepower of target is as follows, it is the implementation example analysis of target to quick commander's control of the quick high hit rate distribution of battle-field guided missile firepower that this implementation example is equally applicable to the minimum that expends time in, and only need objective function this moment $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$ Be replaced into $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},$ With constraint condition D _jy _j+ S _iy _N+i≤ p _IjBe replaced into D _jy _j+ S _iy _N+i≤ d _IjAnd similarly analyze and get final product, suppose that certain combat troop must be 70 kilometers/minute guided missile with each salvo batches 16 pieces, average velocity, from the guided missile of 5 launching site to 14 target emission specified amounts, the emission and destination node between the guided missile no-hit probability, can launch and the quantity of demand guided missile as shown in table 1

Table 1: guided missile no-hit probability, emission measure and demand between emission and destination node (unit: probability, piece)

	01 launching site	02 launching site	03 launching site	04 launching site	05 launching site	Quantity required
							01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points	0.037 0.034 0.025 0.014 0.026 0.024 0.120 0.159 0.112 0.062 0.091 0.126 0.090 0.081	0.013 0.025 0.028 0.015 0.035 0.020 0.098 0.138 0.096 0.037 0.066 0.097 0.068 0.056	0.070 0.083 0.108 0.097 0.082 0.110 0.012 0.051 0.096 0.046 0.017 0.081 0.099 0.020	0.074 0.087 0.112 0.101 0.086 0.100 0.129 0.149 0.025 0.050 0.079 0.086 0.104 0.066	0.044 0.031 0.066 0.058 0.056 0.039 0.105 0.145 0.110 0.059 0.073 0.027 0.011 0.075	36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00
But emission measure	250.00	200.00	300.00	400.00	150.00

The emission and destination node between the missile flight path length, can launch and the quantity of demand guided missile as shown in table 2,

Table 2: missile flight path, emission measure and demand (unit: kilometer, piece) between emission and destination node

	01 launching site	02 launching site	03 launching site	04 launching site	05 launching site	Quantity required
							01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points	37.00 34.00 25.00 14.00 26.00 24.00 120.00 159.00 112.00 62.00 91.00 126.00 90.00 81.00	13.00 25.00 28.00 15.00 35.00 20.00 98.00 138.00 96.00 37.00 66.00 97.00 68.00 56.00	70.00 83.00 108.00 97.00 82.00 110.00 12.00 51.00 96.00 46.00 17.00 81.00 99.00 20.00	74.00 87.00 112.00 101.00 86.00 100.00 129.00 149.00 25.00 50.00 79.00 86.00 104.00 66.00	44.00 31.00 66.00 58.00 56.00 39.00 105.00 145.00 110.00 59.00 73.00 27.00 11.00 75.00	36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00
But emission measure	250.00	200.00	300.00	400.00	150.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the guided missile Fire Distribution option control command that calculates the minimum guided missile no-hit probability of certain combat troop by simplex algorithm is as shown in table 3, and wherein piece probability is the guided missile no-hit probability carrying capacity minZ of destination node _j, in probability be the maximum guided missile no-hit probability p of destination node _j, piece kilometer is the guided missile carrying capacity Z of destination node _j,

Table 3: the minimum guided missile no-hit probability guided missile Fire Distribution option control command (unit: piece, piece risk, probability, piece kilometer, batch, second) of certain combat troop

	01 launching site	02 launching site	03 launching site	04 launching site	05 launching site	Piece probability	Not middle probability	Piece kilometer	Batch	Expend time in	Shadow price
												01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points	90.00 90.00 70.00	36.00 21.00 40.00 40.00 36.00	60.00 16.00 90.00 24.00	29.00	22.00 18.00	0.468 0.525 2.250 1.860 1.820 0.800 0.720 0.816 0.725 1.332 1.530 0.594 0.198 0.480	0.013 0.025 0.025 0.015 0.026 0.020 0.012 0.051 0.025 0.037 0.017 0.027 0.011 0.020	468.00 525.00 2250.00 1860.00 1820.00 800.00 720.00 816.00 725.00 1332.00 1530.00 594.00 198.00 480.00	3 2 6 9 5 3 4 1 2 3 6 2 2 2	11.14 21.43 21.43 12.26 22.29 17.14 10.29 43.71 21.43 31.71 14.57 23.14 9.43 17.14	0.00 12.00 13.00 2.00 14.00 7.00 0.00 39.00 0.00 24.00 5.00 16.00 0.00 8.00
Add up to	250.00	173.00	190.00	29.00	40.00	14.118	0.051	14118.00	50	43.71*
												But emission measure	250.00	200.00	300.00	400.00	150.00
Penetrate the back surplus	0.00	27.00	110.00	371. 00	110.00
												Shadow price	12.00	13.00	12.00	25.00	11. 00

That finishes * that the MISSILE LAUNCHING task expends hour was all for 43.71 seconds

By option control command (table 3) is analyzed as can be known; finish salvo that the MISSILE LAUNCHING task needs and batch add up to 50; time was 43.71 seconds; the salvo that 01～05 launching site needs batch is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 launching site is implemented to lay special stress on protecting; further analyze as can be known; is the bottleneck that the whole MISSILE LAUNCHING task of restriction is finished sooner from 03 launching site to 16 pieces of 43.71 seconds that guided missile spent of 08 impact point emission; this emission also is simultaneously the bottleneck that reduces the guided missile no-hit probability of finishing all battle-field guided missile launch missions; if with speed faster guided missile finish this part task; then the time that whole MISSILE LAUNCHING task is finished can be shortened to for 31.71 seconds; reduction is 27.45%; the guided missile no-hit probability is reduced to 0.037; reduction is 27.45%; and for example fruit is adopted to use the same method and eliminates the bottleneck in 31.71 seconds; then the time that the MISSILE LAUNCHING task can be finished shortened to for 23.14 seconds; reduction reaches 47.06%; the guided missile no-hit probability is reduced to 0.027; reduction is 47.06%; almost only be half of former free and no-hit probability

From to target requirement amount constraint condition D _j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is 0 to be meant in specific span, and relevant constraint condition does not constitute influence to target function value, the easiliest satisfies, again for example, in order to satisfy constraint condition D ₈, the no-hit probability of launching a guided missile to 08 impact point is 0.051,43.71 seconds consuming time, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult to satisfy, can be by D with similar method _jThe complexity that satisfies, from difficulty to easy ordering: D ₈, D ₁₀, D ₁₂, D ₅..., to emission measure constraint condition S _i(i=1 ..., 5) analysis of shadow price as can be known, S _iThe complexity that satisfies, from difficulty to easy ordering: S ₄, S ₂, S ₁, S ₃, S ₅, i.e. constraint condition S ₄It is the most difficult satisfied,

In addition, can launch a guided missile quantity as can be seen from the residue of each launching site of back of finishing the work, the launched a guided missile quantity of 01 launching site and 02 launching site is obviously on the low side, particularly 01 launching site can be launched a guided missile and be exhausted, this statement of facts: can launch a guided missile if 01 launching site has more, add S ₁Constraint condition more easily satisfies, and just may obtain the quick high hit rate plan of distribution of better guided missile firepower, therefore, can also carry out reasonable configuration to the launched a guided missile quantity of each launching site with said method, can the launch a guided missile Optimal Management of quantity of realization.

Claims (9)

1, the present invention relates to quick commander's control method that the quick high hit rate of battle-field guided missile firepower distributes, relate to military affairs and association area, the object of commander's control is all battle-field guided missile firepower, this method is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meet the quick high hit rate of battle-field guided missile firepower until final acquisition and distribute the option control command that requires, this scheme is applicable to commander's control that the quick high hit rate of all battle-field guided missile firepower distributes.

2, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, the object that it is characterized in that described commander's control is meant the object of all battle-field guided missile firepower as commander's control for all battle-field guided missile firepower, the length in described missile flight path is meant that emission side from guided missile is to the geographic distance the target side of guided missile, described commander's control is meant according to the actual demand of battlefield to the guided missile firepower, design is transmitted into different target side with battle-field guided missile from different emission sides, and the total missile flight that needs is expended time in or does not hit probability-weighted for minimum, can be for the scheme of implementing.

3, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described this method is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo is meant by these parameters can set up the supply and demand system that a quick high hit rate of battle-field guided missile firepower distributes, and obtains on this basis the quick high hit rate of battle-field guided missile firepower is distributed the method for implementing commander's control.

4, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described guided missile no-hit probability is meant that complicated battlefield surroundings may impact the hit rate along the guided missile of a certain flight path, thereby reduce the hit rate of guided missile, for expending time in missile flight or the no-hit probability minimum is the commander control of target, this reduction has been equivalent to weaken the power of guided missile firepower, the guided missile no-hit probability can be with the function of time as variable, also can be and irrelevant constant of time, the no-hit probability of the guided missile of different flight paths can be different.

5, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described structure expends time in all missile flights of launching or the no-hit probability minimum is that target and the commander's controlling models with low computational complexity and high solvability are meant for computational complexity that reduces this commander's controlling models and the solvability that improves this commander's controlling models, stipulate that the constraint condition relevant with target side is the constraint condition that equals target side guided missile demand, the constraint condition relevant with emission side is the constraint condition that is not more than the maximum guided missile supply in emission side.

6, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meeting option control command that the quick high hit rate of battle-field guided missile firepower distributes time requirement until final acquisition is meant by the method for finding the solution linear programming and finding the solution the dual program of linear programming and finds the solution commander's controlling models, minimum no-hit probability or the flight path of least consume time that different target side needs can obtain respectively to launch a guided missile from difference emission side, flight time, dependent probability, the shadow price relevant with different target side's constraint condition with different emission sides, the result that will find the solution inserts in a kind of two dimension commander's control form again, according to analysis to this two dimension commander control form, and pass through according to shadow price, no-hit probability bottleneck and time bottleneck are adjusted correlation parameter, constantly find the solution and update, meet the quick high hit rate of battle-field guided missile firepower until final acquisition and distribute the option control command that requires.

7, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, until final acquisition meet the quick high hit rate of battle-field guided missile firepower distribute the option control command that requires to be meant can be by describing the quantity of launching a guided missile to each target side from each emission side as the zones of different in the two-dimentional form of option control command, each target side needs the size of carrying capacity, no-hit probability, the quantity of guided missile salvo, missile flight expends time in and relevant shadow price, the quantity that each emission can be launched a guided missile, residue can the launch a guided missile situation of change and the minimum no-hit probability of all guided missiles of relevant shadow price and emission and the minimum time that expends of quantity.

8, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described this method is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model and is meant that following is the analysis of target to quick commander's control problem of the quick high hit rate distribution of battle-field guided missile firepower with the no-hit probability minimum, but it is the analysis of target to quick commander's control problem of the quick high hit rate distribution of battle-field guided missile firepower that this analysis is equally applicable to the minimum that expends time in, and only need objective function this moment $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$ Be replaced into $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},$ With constraint condition D _jy _j+ S _iy _N+i≤ p _IjBe replaced into D _jy _j+ S _iy _N+i≤ d _IjAnd similarly analyze and get final product, following mathematical formulae, derivation, result of calculation and application process are applicable to quick commander's control that the quick high hit rate of all battle-field guided missile firepower is distributed,

Supposing that the quick high hit rate assignment problem of battle-field guided missile firepower can be with launched a guided missile by m node and n as launching a guided missile the destination node of target and exist the network in a missile flight path to describe between different emissions and destination node, is x from launching the quantity that node i launches a guided missile to destination node j _Ij, the guided missile no-hit probability is p _Ij(t), the length of flight path is d _IjThe guided missile no-hit probability is meant that complicated battlefield surroundings may impact the hit rate along the guided missile of a certain flight path, thereby reduce the hit rate of guided missile, for expending time in missile flight or the no-hit probability minimum is the commander control of target, this reduction has been equivalent to weaken the power of guided missile firepower, the guided missile no-hit probability can be with the function of time as variable, also can be and irrelevant constant of time, is expressed as p _Ij, the no-hit probability of the guided missile of different flight paths can be different,

The problem that need to solve is one of design from m the node of launching a guided missile n the destination node of launching a guided missile, make all no-hit probabilitys of launching a guided missile be minimum, expend time in and satisfy the plan of launching a guided missile of pre-provisioning request simultaneously, and calculate each node of launching a guided missile required guided missile salvo quantity of launching a guided missile, relevant battle-field guided missile Fire Distribution commander's controlling models and linear programming equation are as follows:

Objective function: $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

The constraint condition of destination node guided missile demand: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}=D_j,(j=1,\·\·\·,n)$

The emission node can the amount of launching a guided missile constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ij}}\≤S_i,(i=1,\·\·\·,m)$

Condition of Non-Negative Constrains: x _Ij〉=0, (i=1 ..., m; J=1 ..., n)

Emission node i (i=1 ... m) the quantity V of the guided missile salvo of Xu Yaoing _i:

Guided missile from emission node i (i=1 ... m) fly destination node j (j=1 ... n) spent time: $T_{\mathrm{ij}}=\frac{d_{\mathrm{ij}}}{C}$

Finish all spent minimum time of battle-field guided missile flight: minT=max{T _Ij}

With j the maximum guided missile no-hit probability that destination node is relevant: $p_j=\underset{p_{\mathrm{ij}}\∈P_{\mathrm{op}}}{\max }\left\{p_{\mathrm{ij}}\right\},j(j=1,\·\·\·n)$

Finish the guided missile no-hit probability of all battle-field guided missile emissions: minP=max{p _j, j (j=1 ... n)

With j the guided missile no-hit probability carrying capacity that destination node is relevant: $\min Z_j=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}},j(j=1,\·\·\·n)$

Total guided missile no-hit probability carrying capacity of battle-field guided missile emission: $\min Z=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}\min Z_j$

With j the guided missile carrying capacity that destination node is relevant: $Z_j=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},j(j=1,\·\·\·n)$

The total guided missile carrying capacity in battlefield: $Z=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{Z}_j$

Wherein:

M is the sum of node of launching a guided missile;

N is the sum as the destination node of launching a guided missile;

P _OpBe commander's controlling models p by associated pathway when obtaining optimum solution _IjThe set of forming;

The value of objective function was called guided missile no-hit probability carrying capacity when minZ obtained optimum solution for commander's controlling models, and this value is the smaller the better;

p _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... n) the MISSILE LAUNCHING no-hit probability between can be with the function of time t as variable;

d _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... the length in the missile flight path n) (unit: kilometer);

V _iFor the node i that launches a guided missile (i=1 ... m) quantity of guided missile salvo;

L is the quantity of launching a guided missile (unit: piece) in each salvo;

C is the flying speed of launching a guided missile (unit: kilometer/hour) in each salvo;

S _iFor emission node i (i=1 ... m) quantity that can launch a guided missile (unit: piece);

D _jFor needs to destination node j (j=1 ... the quantity of n) launching a guided missile (unit: piece);

Above-mentioned model shows: objective function be equivalent to ask probability-weighted and, on the basis of trying to achieve guided missile no-hit probability carrying capacity minZ value by linear programming, can calculate the quantity x that each emission node must be launched a guided missile to the destination node of being correlated with _Ij, the p of associated pathway _Ij, according to the quantity L that in each salvo, launches a guided missile, can calculate the salvo quantity V that each destination node needs again _i, at last according to the flying speed C that launches a guided missile in the salvo and between emission and destination node the longest path of missile flight, can calculate the guided missile no-hit probability carrying capacity minZ of each destination node again _j, maximum guided missile no-hit probability p _jFinish the guided missile no-hit probability minP of whole MISSILE LAUNCHING task, the shortest time T that expends, thereby realize the commander that the quick high hit rate of battle-field guided missile firepower distributes is controlled, for constraint condition rationally being set, improving solvability, utilizing above-mentioned linear programming model better, the dual linear programming model that provides this model is as follows:

Objective function: $\max G=\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{D}_j{y}_j+\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{S}_i{y}_{n+i}$

Constraint condition: D _jy _j+ S _iy _N+i≤ p _Ij, (i=1 ..., m; J=1 ..., n)

Condition of Non-Negative Constrains: y _j, y _N+i〉=0, (i=1 ..., m; J=1 ..., n)

Wherein: y _j, y _N+iBe respectively the shadow price or the relevant decision variable of opportunity cost of the constraint condition relevant with emission node guided missile quantity with the target of former linear programming,

Since primal linear programming solves be with destination node j and emission node i (i=1 ..., m; J=1 ..., the resource optimal utilization problem that constraint condition n) is relevant, thus dual program solve then be estimate to make destination node j and emission node i (i=1 ..., m; J=1 ..., constraint condition n) satisfies the cost problem that must pay, promptly uses the valency problem, and shadow price y _jAnd y _N+iReflection make just destination node j and emission node i (i=1 ..., m; J=1, n) constraint condition satisfies the cost that must pay, by making the target function value relevant minimize (or maximization) with cost, shadow price can be used for each constraint condition of comparison and carry out equivalence analysis to the contribution of target function value or to this contribution influence, shadow price is big more, show that this constraint condition is big more to the influence of the minimum guided missile no-hit probability delivery power of option control command, but it is also just difficult more to satisfy this condition, therefore, introducing shadow price just can be by comparing shadow price and realistic objective functional value, and can variation that study former linear programming constraint condition make objective function obtain gain.

9, quick commander's control method that the quick high hit rate of battle-field guided missile firepower according to claim 1 distributes, it is characterized in that described this method is according to the length from difference emission side to missile flight path, different target side, the guided missile no-hit probability, the demand of the supply of the side's of emission guided missile and target side guided missile, the quantity of the speed of missile flight and guided missile salvo, structure expends time in all missile flights of launching or the no-hit probability minimum is target and the commander's controlling models with low computational complexity and high solvability, and use linear programming, the dual program method of linear programming is found the solution this model, by two-dimentional form solving result is updated again, meeting the quick high hit rate of battle-field guided missile firepower until final acquisition distributes the option control command that requires to be meant if the option control command of trying to achieve can not satisfy predetermined guided missile no-hit probability or the requirement of flight time, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence battle-field guided missile no-hit probability and the bottleneck of missile flight T.T., carry out reasonable disposition by the quantity that can launch a guided missile to emission again, increase the quantity of salvo batch and the means such as guided missile that adopt different accuracy at targets or flying speed, eliminate no-hit probability bottleneck and time bottleneck, and repeat this process, the predetermined requirement that meets T.T. until the no-hit probability of battle-field guided missile of emission and flight, this process can be described with following example with the quick commander's control that to be target distribute the quick high hit rate of battle-field guided missile firepower of no-hit probability minimum, it is the instance analysis of target to quick commander's control of the quick high hit rate distribution of battle-field guided missile firepower that this example is equally applicable to the minimum that expends time in, and only need objective function this moment $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{p}_{\mathrm{ij}}{x}_{\mathrm{ij}}$ Be replaced into $\min Z=\underset{i=1}{\overset{m}{\mathrm{\Σ}}}\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}},$ With constraint condition D _jy _j+ S _iy _N+i≤ p _IjBe replaced into D _jy _j+ S _iy _N+i≤ d _IjAnd similarly analyze and get final product, but the mathematical formulae described in example, result of calculation, various form and application process are applicable to quick commander's control that the quick high hit rate of all battle-field guided missile firepower is distributed,

Suppose that certain combat troop must be 70 kilometers/minute guided missile with each salvo batches 16 pieces, average velocity, from the guided missile of 5 launching site to 14 target emission specified amounts, the emission and destination node between the guided missile no-hit probability, can launch and the quantity of demand guided missile as shown in table 1

Table 1: guided missile no-hit probability, emission measure and demand between emission and destination node (unit: probability, piece) 01 launching site 02 launching site 03 launching site 04 launching site 05 launching site Quantity required 01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points 0.037 0.034 0.025 0.014 0.026 0.024 0.120 0.159 0.112 0.062 0.091 0.126 0.090 0.081 0.013 0.025 0.028 0.015 0.035 0.020 0.098 0.138 0.096 0.037 0.066 0.097 0.068 0.056 0.070 0.083 0.108 0.097 0.082 0.110 0.012 0.051 0.096 0.046 0.017 0.081 0.099 0.020 0.074 0.087 0.112 0.101 0.086 0.100 0.129 0.149 0.025 0.050 0.079 0.086 0.104 0.066 0.044 0.031 0.066 0.058 0.056 0.039 0.105 0.145 0.110 0.059 0.073 0.027 0.011 0.075 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00 But emission measure 250.00 200.00 300.00 400.00 150.00

The emission and destination node between the missile flight path length, can launch and the quantity of demand guided missile as shown in table 2,

Table 2: missile flight path, emission measure and demand (unit: kilometer, piece) between emission and destination node 01 launching site 02 launching site 03 launching site 04 launching site 05 launching site Quantity required 01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points 37.00 34.00 25.00 14.00 26.00 24.00 120.00 159.00 112.00 62.00 91.00 126.00 90.00 81.00 13.00 25.00 28.00 15.00 35.00 20.00 98.00 138.00 96.00 37.00 66.00 97.00 68.00 56.00 70.00 83.00 108.00 97.00 82.00 110.00 12.00 51.00 96.00 46.00 17.00 81.00 99.00 20.00 74.00 87.00 112.00 101.00 86.00 100.00 129.00 149.00 25.00 50.00 79.00 86.00 104.00 66.00 44.00 31.00 66.00 58.00 56.00 39.00 105.00 145.00 110.00 59.00 73.00 27.00 11.00 75.00 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 22.00 18.00 24.00 But emission measure 250.00 200.00 300.00 400.00 150.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, the guided missile Fire Distribution option control command that calculates the minimum guided missile no-hit probability of certain combat troop by simplex algorithm is as shown in table 3, and wherein piece probability is the guided missile no-hit probability carrying capacity minZ of destination node _j, in probability be the maximum guided missile no-hit probability p of destination node _j, piece kilometer is the guided missile carrying capacity Z of destination node _j,

Table 3: the minimum guided missile no-hit probability guided missile Fire Distribution option control command (unit: piece, piece risk, probability, piece kilometer, batch, second) of certain combat troop 01 launching site 02 launching site 03 launching site 04 launching site 05 launching site Piece probability Not middle probability Piece kilometer Batch Expend time in Shadow price 01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point, 07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points 90.00 90.00 70.00 36.00 21.00 40.00 40.00 36.00 60.00 16.00 90.00 24.00 29.00 22.00 18.00 0.468 0.525 2.250 1.860 1.820 0.800 0.720 0.816 0.725 1.332 1.530 0.594 0.198 0.480 0.013 0.025 0.025 0.015 0.026 0.020 0.012 0.051 0.025 0.037 0.017 0.027 0.011 0.020 468.00 525.00 2250.00 1860.00 1820.00 800.00 720.00 816.00 725.00 1332.00 1530.00 594.00 198.00 480.00 3 2 6 9 5 3 4 1 2 3 6 2 2 2 11.14 21.43 21.43 12.26 22.29 17.14 10.29 43.71 21.43 31.71 14.57 23.14 9.43 17.14 0.00 12.00 13.00 2.00 14.00 7.00 0.00 39.00 0.00 24.00 5.00 16.00 0.00 8.00 Add up to 250.00 173.00 190.00 29.00 40.00 14.118 0.051 14118.00 50 43.71 But emission measure 250.00 200.00 300.00 400.00 150.00 Penetrate the back surplus 0.00 27.00 110.00 371.00 110.00 Shadow price 12.00 13.00 12.00 25.00 11.00

* finishing the minimum time that the MISSILE LAUNCHING task expends was 43.71 seconds

By option control command (table 3) is analyzed as can be known; finish salvo that the MISSILE LAUNCHING task needs and batch add up to 50; time was 43.71 seconds; the salvo that 01～05 launching site needs batch is respectively 17; 14; 13; 2 and 4; therefore must be to 01; 02 and 03 launching site is implemented to lay special stress on protecting; further analyze as can be known; is the bottleneck that the whole MISSILE LAUNCHING task of restriction is finished sooner from 03 launching site to 16 pieces of 43.71 seconds that guided missile spent of 08 impact point emission; this emission also is simultaneously the bottleneck that reduces the guided missile no-hit probability of finishing all battle-field guided missile launch missions; if with speed faster guided missile finish this part task; then the time that whole MISSILE LAUNCHING task is finished can be shortened to for 31.71 seconds; reduction is 27.45%; the guided missile no-hit probability is reduced to 0.037; reduction is 27.45%; and for example fruit is adopted to use the same method and eliminates the bottleneck in 31.71 seconds; then the time that the MISSILE LAUNCHING task can be finished shortened to for 23.14 seconds; reduction reaches 47.06%; the guided missile no-hit probability is reduced to 0.027; reduction is 47.06%; almost only be half of former free and no-hit probability

From to target requirement amount constraint condition D _j(j=1,14) analysis of shadow price as can be known, the size of price has truly reflected the complexity that the related constraint condition satisfies, shadow price is 0 to be meant in specific span, and relevant constraint condition does not constitute influence to target function value, the easiliest satisfies, again for example, in order to satisfy constraint condition D ₈, the no-hit probability of launching a guided missile to 08 impact point is 0.051,43.71 seconds consuming time, the shadow price of this constraint condition is a maximal value 39, illustrates that this condition is the most difficult to satisfy, can be by D with similar method _jThe complexity that satisfies, from difficulty to easy ordering: D ₈, D ₁₀, D ₁₂, D ₅..., to emission measure constraint condition S _i(i=1 ..., 5) analysis of shadow price as can be known, S _iThe complexity that satisfies, from difficulty to easy ordering: S ₄, S ₂, S ₁, S ₃, S ₅, i.e. constraint condition S ₄It is the most difficult satisfied,

In addition, can launch a guided missile quantity as can be seen from the residue of each launching site of back of finishing the work, the launched a guided missile quantity of 01 launching site and 02 launching site is obviously on the low side, particularly 01 launching site can be launched a guided missile and be exhausted, this statement of facts: can launch a guided missile if 01 launching site has more, add S ₁Constraint condition more easily satisfies, and just may obtain the quick high hit rate plan of distribution of better guided missile firepower, therefore, can also carry out reasonable configuration to the launched a guided missile quantity of each launching site with said method, can the launch a guided missile Optimal Management of quantity of realization.