CN1848158A - Command control method for battle field guided missile firepower fast distribution - Google Patents

Abstract

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

Description

Commander's control method that a kind of battle-field guided missile firepower distributes fast

Technical field the present invention relates to national defence and association area, is used for the battle-field guided missile firepower is distributed enforcement commander control fast, realizes the battle-field guided missile firepower is distributed fast.

Background technology is implemented commander's control that the guided missile firepower distributes fast 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 without hindrance flight probability of flight path, 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 is that commander's controlling models of target is that the battlefield commander distributes fast the battle-field guided missile firepower and implements the key issue that commander's control must solve with all missile flights of emission minimum that expends time in, 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 traffic capacity in missile flight path, thereby reduce the passage rate of missile flight, and make commander's control of the guided missile hit quickly of emission is the key that improves the firepower strike effect of guided missile, and wherein the matter of utmost importance that must solve is guided missile firepower commander's control plan of distribution fast of formulation science.The quality of this plan, not only be related to and implement the battle-field guided missile firepower and distribute what of institute's consumption of natural resource fast, but also be related to the guided missile hit in time of emission, to guarantee that fighting capacity is unlikely to descend because of the real-time of the guided missile of emission or the delay of missile flight time.

Time seems more important for commander's control of battle-field guided missile Fire Distribution and this guided missile Fire Distribution, therefore must antithesis analyze the choose reasonable parameter improve solvability and with missile flight time minimum come the battle-field guided missile firepower distributed fast as optimization aim and implement commander and control.

The present invention relates to commander's control method that the battle-field guided missile firepower distributes fast, 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 without hindrance flight probability of flight path, 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 is commander's controlling models of target with all missile flights minimum that expends time in of emission, 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 option control command that the battle-field guided missile firepower distributes time requirement fast until final acquisition, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in commander's control that all battle-field guided missile firepower distribute fast, 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 without hindrance flight probability of flight path, 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 is commander's controlling models of target with all missile flights minimum that expends time in of emission, 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 battle-field guided missile firepower is distributed fast, and check whether this option control command meets the time demand of finishing the quick allocating task of whole battle-field guided missile firepower, if do not meet the demands, then by analysis to this two dimension commander control form, and according to shadow price, the time bottleneck is adjusted the launched a guided missile quantity of associated transmissions side and the flying speed of guided missile etc., constantly repeat this and find the solution-check analytic process, meet the option control command that the battle-field guided missile firepower distributes time requirement fast until final acquisition.Therefore, the conception of commander's control of distribution fast of battle-field guided missile firepower is proposed, introduce the analytical approach of the without hindrance flight probability in missile flight path, set up linear programming and the dual program model of seeking optimum option control command, by finding the solution this model, obtain with implementing to command the scheme of controlling two-dimentional form description the battle-field guided missile firepower is distributed fast, and according to the time requirement of finishing whole MISSILE LAUNCHING task, by searching the time bottleneck that the quick 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 flying speed of guided missile adjusted, continue to optimize and improve this option control command, and the final time requirement that obtains to satisfy the quick 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 commander's control method that a kind of battle-field guided missile firepower of the present invention distributes fast is:

At first, the quick 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 without hindrance flight probability of flight path, 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 time requirement to the battlefield MISSILE LAUNCHING, structure is commander's controlling models of target with all missile flights minimum that expends time in of emission, 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 battle-field guided missile firepower is distributed fast, 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 flying speeds, the final time requirement that obtains to satisfy the quick distribution of battle-field guided missile firepower, the battle-field guided missile firepower is distributed the scheme of implementing commander's control fast, finish commander's control that the battle-field guided missile firepower is distributed fast.

Complicated battlefield surroundings may impact the traffic capacity in missile flight path, thereby reduce the passage rate of missile flight, for the minimum that expends time in missile flight is commander's control of target, this reduction has been equivalent to increase the length in missile flight path, missile flight path after claiming to increase is an equivalent path length, the without hindrance flight probability of flight path is with the function of time as variable, equivalent missile flight path then is with the function of the without hindrance flight probability of real missile flight path length and relevant flight path as variable, when the without hindrance flight probability of flight path is 1, real missile flight path length equates with equivalent missile flight path, and the without hindrance flight probability in missile flight path is more little, and then compare equivalent flight path length with the practical flight path just long more.

Usually, the target of the objective function of commander's controlling models is for making the missile flight minimum that expends time in, but when the without hindrance flight probability of the flight path in all paths was 1, the target of the objective function of this commander's controlling models also was minimum for the carrying capacity that all missile flights are needed simultaneously.

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, the minimum time that different target side needs can obtain respectively to launch a guided missile from difference emission side, 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, by analysis to this form, and according to shadow price, the time bottleneck is adjusted correlation parameter, constantly find the solution and update, can finally obtain to meet the option control command that the battle-field guided missile firepower distributes time requirement fast.

Can the quantity of the quantity of launching a guided missile to each target side from each emission side, size that each target side needs carrying capacity, salvo batch, minimum time and the relevant shadow price that missile flight expends be described by the zones of different in the two dimension commander control form, the minimum time that all missile flights of the quantity that each emission can be launched a guided missile, the situation of change that remains the quantity of can launching a guided missile and relevant shadow price and emission expend.

If the option control command of trying to achieve can not satisfy the preset time requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence the battle-field guided missile bottleneck of flight time accumulation, carry out the means such as guided missile of reasonable disposition, employing friction speed again by the quantity that can launch a guided missile to emission, eliminate the time bottleneck, and repeat this process, until making the T.T. of finishing the battle-field guided missile Fire Distribution meet predetermined requirement.

Commander's control method that the battle-field guided missile firepower of the present invention's design distributes fast is applicable to that it is key character of the present invention that all battle-field guided missile firepower distribute fast.

The case study of commander's control that the battle-field guided missile firepower distributes fast is as follows.

Supposing that battle-field guided missile Fire Distribution problem 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 without hindrance flight probability in missile flight path is p _Ij(t), the physical length of flight path is r _Ij, the equivalent length of flight path is d _IjThe without hindrance flight probability of flight path is meant that complicated battlefield surroundings may impact the traffic capacity in missile flight path, thereby reduce the passage rate of flight guided missile, for the minimum that expends time in missile flight is commander's control of target, this reduction has been equivalent to increase the length in missile flight path, flight path length after claiming to increase is equivalent path length, the without hindrance flight probability of flight path is with the function of time as variable, equivalent flight path length then is with the function of the without hindrance flight probability of practical flight path and relevant flight path as variable, when the without hindrance flight probability of flight path is 1, practical flight path and equivalent flight path equal in length.

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 the carrying capacity and the consumed time of all missile flight costs be the minimum plan of launching a guided missile 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{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

Destination node guided missile demand equals constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ie}}=D_e,(e=1,\·\·\·,n_e)$

Destination node guided missile demand is less than constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{il}}{\≤D}_l,(l=n_e+1,\·\·\·,n_l)$

Destination node guided missile demand is greater than constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{is}}{\≥D}_s,(s=n_l+1,\·\·\·,n_s)$

The emission node can the amount of launching a guided missile equal constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ej}}=S_e,(e=n_s+1,\·\·\·,m_e)$

The emission node can the amount of launching a guided missile less than constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{lj}}{\≤S}_l,(l=m_e+1,\·\·\·,m_l)$

The emission node can the amount of launching a guided missile greater than constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{sj}}{\≥S}_s,(s=m_l+1,\·\·\·,m_s)$

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

The classification of the amount relevant with the destination node Demand Constraint: $D_v=\left\{\begin{array}{c}{D}_e,(1\≤v\≤n_e)\\ D_l,(n_e+1\≤v\≤n_l)\\ D_s,(n_l+1\≤v\≤n_s)\end{array}\right.$

With the emission node can the amount of launching a guided missile the classification of the relevant amount of constraint: $S_u=\left\{\begin{array}{c}{S}_e,(n_s+1\≤u\≤m_e)\\ S_l,(m_e+1\≤u\≤m_l)\\ S_s,(m_l+1\≤u\≤m_s)\end{array}\right.$

The equivalent length in missile flight path is: d _Ij=f (r _Ij, p _Ij(t)), (0＜p _Ij(t)≤1; 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 times of battle-field guided missile flight: min T=max{T _Ij}

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;

r _IjFor from emission node i (i=1 ... m) to destination node j (j=1 ... n) physical length in missile flight path (unit: kilometer);

p _Ij(t) for emission node i (i=1 ... m) with destination node j (j=1 ... n) the without hindrance flight probability in the missile flight path between is with the function of time t as variable;

d _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... the equivalent length in the missile flight path n) (unit: kilometer), work as p _Ij(t)=1 o'clock, r _IjWith d _IjEquate;

E is the sequence number that equals the amount of equaling of constraint condition;

L is the sequence number less than the constraint condition upper limit;

S is the sequence number greater than the constraint condition lower limit;

n _eMaximum sequence number for the equal amount that equal constraint condition relevant with the destination node demand;

n _lBe the maximum sequence number less than the constraint condition upper limit relevant with the destination node demand;

n _sBe the maximum sequence number greater than constraint condition lower limit relevant with the destination node demand;

D _eFor the amount relevant with destination node guided missile demand (e=1 ..., n _e) (unit: piece);

D _lBe the upper limit (l=n relevant with destination node guided missile demand _e+ 1 ..., n _l) (unit: piece);

D _sBe the lower limit (s=n relevant with destination node guided missile demand _l+ 1 ..., n _s) (unit: piece);

m _eFor with the maximum sequence number of can the amount of the launching a guided missile relevant amount of equaling that equals constraint condition of emission node;

m _lFor with the emission node can the relevant maximum sequence number of the amount of launching a guided missile less than the constraint condition upper limit;

m _sFor with the emission node can the relevant maximum sequence number of the amount of launching a guided missile greater than the constraint condition lower limit;

S _eFor with the emission node can the relevant amount (e=n of the amount of launching a guided missile _s+ 1 ..., m _e) (unit: piece);

S _lFor with the emission node can the relevant upper limit (l=m of the amount of launching a guided missile _e+ 1 ..., m _l) (unit: piece);

S _sFor with the emission node can the relevant lower limit (s=m of the amount of launching a guided missile _l+ 1 ..., m _s) (unit: piece);

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;

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate the quantity x that each emission node must be launched a guided missile to relevant destination node _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 _iAt 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 again and finish the spent shortest time T of whole MISSILE LAUNCHING task, thereby realize that the commander that the battle-field guided missile firepower is distributed fast controls, 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{v=1}{\overset{n_e}{\mathrm{\Σ}}}{D}_v{y}_v+\underset{v=n_e+1}{\overset{n_l}{\mathrm{\Σ}}}{D}_v{y}_v+\underset{v=n_l+1}{\overset{n_s}{\mathrm{\Σ}}}{d}_v{y}_v+\underset{u=n_s+1}{\overset{m_e}{\mathrm{\Σ}}}{S}_u{y}_u+\underset{u=m_e+1}{\overset{m_l}{\mathrm{\Σ}}}{S}_u{y}_u+\underset{u=m_l+1}{\overset{m_s}{\mathrm{\Σ}}}{S}_u{y}_u$

Constraint condition: $D_e{y}_{n_e\left(j\right)}+D_l{y}_{n_l\left(j\right)}+D_s{y}_{n_s\left(j\right)}+S_e{y}_{m_e\left(i\right)}+S_l{y}_{m_l\left(i\right)}+S_s{y}_{m_s\left(i\right)}{\≤d}_{\mathrm{ij}}(i=1,\·\·\·,m;j=1,\·\·\·,n)$

Condition of Non-Negative Constrains: $y_{m_l\left(i\right)},y_{n_l\left(j\right)}\≤0(i=1,\·\·\·,m;j=1,\·\·\·,n)$

Non-positive constraint condition: $y_{m_s\left(i\right)},y_{n_s\left(j\right)}\≥0(i=1,\·\·\·,m;j=1,\·\·\·,n)$

Wherein:

$y_{n_e\left(j\right)}=y_v(1\≤v\≤n_e),y_{n_l\left(j\right)}=y_v(n_e+1\≤v\≤n_l),y_{n_s\left(j\right)}=y_v(n_l+1\≤v\≤n_s)$ Be the variable subscript sequence number transforming function transformation function relevant with j:

$y_{m_e\left(i\right)}=y_u(n_s+1\≤u\≤m_e),y_{m_l\left(i\right)}=y_u(m_e+1\≤u\≤m_l),y_{m_s\left(i\right)}=y_u(m_l+1\≤u\≤m_s)$ Be the variable subscript sequence number transforming function transformation function relevant with i;

y _v, y _u(v=1 ..., n _sU=n _s+ 1 ..., m _s) be 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 _vAnd y _uReflection 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 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 distribution capability of battle-field guided missile firepower of combat troop is an important component part of its fighting capacity, to huge quick distribution capability of 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, suppose that certain combat troop must be with each salvo batches 16 pieces, average velocity is 70 kilometers/minute guided missile, from the guided missile of 6 launching site to 14 target emission specified amounts, the length in missile flight path between emission and the destination node, can launch with the bound of demand guided missile quantity as shown in table 1ly, make the without hindrance flight Probability p in all missile flight paths here _Ij(t) be 1, d _Ij=r _Ij/ p _Ij(t), therefore the real missile flight path length between difference emission and destination node equates with equivalent missile flight path, i.e. r _IjWith d _IjEquate.

Table 1: 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	06 launching site	The demand upper limit	The demand lower limit
									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	60.00 19.00 56.00 30.00 48.00 65.00 75.00 30.00 69.00 70.00 26.00 65.00 72.00 44.00	36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 30.00 35.00 28.00	36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 80.00 20.00 25.00 22.00
Can send out the upper limit	100.00	200.00	300.00	400.00	150.00	350.00
									Can give limit	100.00	60.00	40.00	10.00	10.00	20.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, as shown in table 2 by certain combat troop's minimum time guided missile Fire Distribution option control command that simplex algorithm calculates.

Table 2: certain combat troop's minimum time guided missile Fire Distribution option control command (unit: piece, piece kilometer, batch, second)

	01 launching site	02 launching site	03 launching site	04 launching site	05 launching site	06 launching site	Piece kilometer	Salvo batch	Expend time in	Upper limit shadow valency	Lower limit shadow valency
												01 impact point, 02 impact point, 03 impact point, 04 impact point, 05 impact point, 06 impact point	30.00 70.00	36.00 60.00 64.00 40.00				21.00 66.00	468.00 399.00 2430.00 2940.00 1820.00 800.00	3 2 6 9 5 3	11.14 16.29 24.00 25.71 22.29 17.14	13.00 19.00 25.00 14.00 26.00 20.00	13.00 19.00 25.00 14.00 26.00 20.00

07 impact point, 08 impact point, 09 impact point, 10 impact points, 11 impact points, 12 impact points, 13 impact points, 14 impact points			60.00 36.00 80.00 22.00	29.00	20.00 25.00	16.00	720.00 480.00 725.00 1656.00 1360.00 540.00 275.00 440.00	4 1 2 3 5 2 2 2	10.29 25.71 21.43 39.43 14.57 23.14 9.43 17.14	12.00 30.00 25.00 37.00 0.00 0.00 0.00 0.00	12.00 30.00 25.00 37.00 17.00 27.00 11.00 20.00
												Add up to	100.00	200.00	198.00	29.00	45.00	103.00	15053.00	49	39.43 *
But emission measure	100.00	200.00	300.00	400.00	150.00	350.00
												Send out the back surplus	0.00	0.00	102.00	371.00	105.00	247.00
Upper limit shadow valency	0.00	0.00	0.00	0.00	0.00	0.00
												Lower limit shadow valency	0.00	0.00	0.00	0.00	0.00	0.00

* finish the minimum time that the MISSILE LAUNCHING task expends

By option control command (table 2) is analyzed as can be known; finish salvo that the MISSILE LAUNCHING task needs and batch add up to 49; time was 39.43 seconds; the salvo that 01～06 launching site needs batch is respectively 11; 16; 14; 2; 4 and 12; therefore must be to 02; 03 and 06 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 36 pieces of 39.43 seconds that guided missile spent of 10 impact points emission; 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 25.71 seconds, reduction is 34.80%.

From to target requirement amount constraint condition D _v(v=1,18) 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, relevant constraint condition does not constitute influence to target function value, the easiest to be satisfied, promptly this resource is not in short supply, if increase this resource again the optimal value of objective function is further reduced, again for example, in order to satisfy constraint condition D ₁₀, to launch a guided missile 39.43 seconds consuming time to 10 impact points, the shadow price of this constraint condition is a maximal value 37, illustrates that this condition is the most difficult satisfied, can be by D with similar method _vThe complexity that satisfies, from difficulty to easy ordering: D ₁₀, D ₈, D ₁₆, D ₅, D ₃, D ₉..., to emission measure constraint condition S _u(u=19 ..., 29) analysis of shadow price as can be known, their shadow price is 0, therefore, in specific span, changes S _uValue target function value is not constituted influence, must be pointed out that shadow price is not changeless, can be along with D _vAnd S _uVariation and change, make the resource that does not constitute influence originally become influential resource, by analysis to shadow price, can adjust constraint condition targetedly, reach and reduce carrying capacity and finish the purpose that the MISSILE LAUNCHING task needs the time, because shadow price is the result who obtains under specific constraint condition, only in its valid interval, price just has relative stability.

Can launch a guided missile quantity as can be seen from the residue of each launching site of back of finishing the work, launching a guided missile of 02 launching site exhausts, obviously on the low side, and the launched a guided missile amount of 04 launching site is obviously bigger than normal, according to the antithesis analysis, the shadow price of their constraint condition is 0, this statement of facts: can launch a guided missile if 02 launching site has more, 04 launching site has launching a guided missile still less, just may obtain better to command control plan, so adjust the upper limit S of constraint condition targetedly ₂₅Be increased to 400 from 200, make S simultaneously ₂₇Reduce to 200 from 400, the improvement project of certain combat troop's minimum time guided missile Fire Distribution option control command of obtaining is as shown in table 3.

Table 3: the improvement project (unit: piece, piece kilometer, batch, second) of certain combat troop's minimum time guided missile Fire Distribution option control command

	01 launching site	02 launching site	03 launching site	04 launching site	05 launching site	06 launching site	Piece kilometer	Salvo batch	Expend time in	Upper limit shadow valency	Lower limit shadow valency
												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	30.00 70.00	36.00 60.00 130.00 40.00 36.00	60.00 80.00 22.00	29.00	20.00 25.00	21.00 16.00	468.00 399.00 2430.00 1950.00 1820.00 800.00 720.00 480.00 725.00 1332.00 1360.00 540.00 275.00 440.00	3 2 6 9 5 3 4 1 2 3 5 2 2 2	11.14 16.29 24.00 12.86 22.29 17.14 10.29 25.71 21.43 31.71 14.57 23.14 9.43 17.14	13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 0.00 0.00 0.00 0.00	13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 17.00 27.00 11.00 20.00
Add up to	100.00	302.00	162.00	29.00	45.00	37.00	13739.00	49	31.71 *
												But emission measure	100.00	400.00	300.00	200.00	150.00	350.00
Send out the back surplus	0.00	98.00	138.00	171.00	105.00	313.00
												Upper limit shadow valency	0.00	0.00	0.00	0.00	0.00	0.00
Lower limit shadow valency	0.00	0.00	0.00	0.00	0.00	0.00

* finish the minimum time that the MISSILE LAUNCHING task expends

Analysis by his-and-hers watches 3 as can be known, the time that finishing the MISSILE LAUNCHING task needs shortens to 31.71 minutes, amount of decrease is 19.58%, total carrying capacity is reduced to 13739 pieces of kilometers, and amount of decrease is 8.73%, and antithesis the analysis showed that: shadow price is without any variation, but the scheme after improving is better, therefore, can also carry out reasonable configuration to the launched a guided missile quantity of each launching site, can the launch a guided missile Optimal Management of quantity of realization with said method.

Claims (9)

1, the present invention relates to commander's control method that the battle-field guided missile firepower distributes fast, 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 without hindrance flight probability of flight path, 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 is commander's controlling models of target with all missile flights minimum that expends time in of emission, 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 option control command that the battle-field guided missile firepower distributes time requirement fast until final acquisition, this method can obviously be improved its combat capabilities, be widely used in quick commander's control that all battle-field guided missile firepower distribute fast, the invention further relates to the technology of this method of realization.

2, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, 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 makes total missile flight time of needing or total carrying capacity for minimum, can be for the scheme of implementing.

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

4, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, it is characterized in that the without hindrance flight probability of described flight path is meant that complicated battlefield surroundings may impact the traffic capacity in missile flight path, thereby reduce the passage rate of missile flight, for the minimum that expends time in missile flight is commander's control of target, this reduction has been equivalent to increase the length in missile flight path, missile flight path after claiming to increase is an equivalent path length, the without hindrance flight probability of flight path is with the function of time as variable, equivalent missile flight path then is with the function of the without hindrance flight probability of real missile flight path length and relevant flight path as variable, when the without hindrance flight probability of flight path was 1, real missile flight path length equated with equivalent missile flight path.

5, the quick commander's control method of distributing of battle-field guided missile firepower according to claim 1, it is characterized in that described structure is that the target of commander's controlling models of target objective function of being meant this commander's controlling models is for making the missile flight minimum that expends time in all missile flights of emission minimum that expends time in, but when the without hindrance flight probability of the flight path in all paths was 1, the target of the objective function of this commander's controlling models also was minimum for the carrying capacity that all missile flights are needed simultaneously.

6, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, 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 battle-field guided missile firepower distributes time requirement fast 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, the minimum time that different target side needs can obtain respectively to launch a guided missile from difference emission side, 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, the time bottleneck is adjusted correlation parameter, constantly find the solution and update, meet the option control command that the battle-field guided missile firepower distributes time requirement fast until final acquisition.

7, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, 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 until final acquisition that option control command that the battle-field guided missile firepower distributes time requirement fast is 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, the quantity of guided missile salvo, minimum time that missile flight expends and relevant shadow price, the quantity that each emission can be launched a guided missile, residue can launch a guided missile situation of change and the relevant shadow price of quantity and the minimum time that all missile-target impacts of emission are expended.

8, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, 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 without hindrance flight probability of flight path, 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 is commander's controlling models of target with all missile flights minimum that expends time in of emission, and use linear programming, the dual program method of linear programming is found the solution this model and is meant following quick commander's control problem analysis that the battle-field guided missile firepower is distributed fast, but following mathematical formulae, derivation, result of calculation and application process are applicable to quick commander's control that all battle-field guided missile firepower are distributed fast

Supposing that battle-field guided missile Fire Distribution problem 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 without hindrance flight probability in missile flight path is p _Ij(t), the physical length of flight path is r _Ij, the equivalent length of flight path is d _IjThe without hindrance flight probability of flight path is meant that complicated battlefield surroundings may impact the traffic capacity in missile flight path, thereby reduce the passage rate of flight guided missile, for the minimum that expends time in missile flight is commander's control of target, this reduction has been equivalent to increase the length in missile flight path, flight path length after claiming to increase is equivalent path length, the without hindrance flight probability of flight path is with the function of time as variable, equivalent flight path length then is with the function of the without hindrance flight probability of practical flight path and relevant flight path as variable, when the without hindrance flight probability of flight path is 1, practical flight path and equivalent flight path equal in length

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 the carrying capacity and the consumed time of all missile flight costs be the minimum plan of launching a guided missile 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{\Σ}}}{d}_{\mathrm{ij}}{x}_{\mathrm{ij}}$

Destination node guided missile demand equals constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{ie}}=D_e,$ (e＝1，…，n _e)

Destination node guided missile demand is less than constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{il}}\≤D_l,$ (l＝n _e+1，…，n _l)

Destination node guided missile demand is greater than constraint condition: $\underset{i=1}{\overset{m}{\mathrm{\Σ}}}{x}_{\mathrm{is}}\≥D_s,$ (s＝n _l+1，…，n _s)

The emission node can the amount of launching a guided missile equal constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{ej}}=S_e,$ (e＝n _s+1，…，m _e)

The emission node can the amount of launching a guided missile less than constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{lj}}\≤S_l,$ (l＝m _e+1，…，m _l)

The emission node can the amount of launching a guided missile greater than constraint condition: $\underset{j=1}{\overset{n}{\mathrm{\Σ}}}{x}_{\mathrm{sj}}\≥S_s,$ (s＝m _l+1，…，m _s)

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

The classification of the amount relevant with the destination node Demand Constraint: $D_v=\left\{\begin{array}{c}{D}_e,(1\≤v\≤n_e)\\ D_l,(n_e+1\≤v\≤n_l)\\ D_s,(n_l+1\≤v\≤n_s)\end{array}\right.$

With the emission node can the amount of launching a guided missile the classification of the relevant amount of constraint: $S_u=\left\{\begin{array}{c}{S}_e,(n_s+1\≤u\≤m_e)\\ S_l,(m_e+1\≤u\≤m_l)\\ S_s,(m_l+1\≤u\≤m_s)\end{array}\right.$

The equivalent length in missile flight path is: d _Ij=f (r _Ij, p _Ij(t)), (0＜p _Ij(t)≤1; 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 times of battle-field guided missile flight: min T=max{T _Ij}

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;

r _IjFor from emission node i (i=1 ... m) to destination node j (j=1 ... n) physical length in missile flight path (unit: kilometer);

p _Ij(t) for emission node i (i=1 ... m) with destination node j (j=1 ... n) the without hindrance flight probability in the missile flight path between is with the function of time t as variable;

d _IjFor emission node i (i=1 ... m) with destination node j (j=1 ... the equivalent length in the missile flight path n) (unit: kilometer), work as p _Ij(t)=1 o'clock, r _IjWith d _IjEquate;

E is the sequence number that equals the amount of equaling of constraint condition;

L is the sequence number less than the constraint condition upper limit;

S is the sequence number greater than the constraint condition lower limit;

n _eMaximum sequence number for the equal amount that equal constraint condition relevant with the destination node demand;

n _lBe the maximum sequence number less than the constraint condition upper limit relevant with the destination node demand;

n _sBe the maximum sequence number greater than constraint condition lower limit relevant with the destination node demand;

D _eFor the amount relevant with destination node guided missile demand (e=1 ..., n _e) (unit: piece);

D _lBe the upper limit (l=n relevant with destination node guided missile demand _e+ 1 ..., n _l) (unit: piece);

D _sBe the lower limit (s=n relevant with destination node guided missile demand _l+ 1 ..., n _s) (unit: piece);

m _eFor with the maximum sequence number of can the amount of the launching a guided missile relevant amount of equaling that equals constraint condition of emission node;

m _lFor with the emission node can the relevant maximum sequence number of the amount of launching a guided missile less than the constraint condition upper limit;

m _sFor with the emission node can the relevant maximum sequence number of the amount of launching a guided missile greater than the constraint condition lower limit;

S _eFor with the emission node can the relevant amount (e=n of the amount of launching a guided missile _s+ 1 ..., m _e) (unit: piece);

S _lFor with the emission node can the relevant upper limit (l=m of the amount of launching a guided missile _e+ 1 ..., m _l) (unit: piece);

S _sFor with the emission node can the relevant lower limit (s=m of the amount of launching a guided missile _l+ 1 ..., m _s) (unit: piece);

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;

Above-mentioned model shows: try to achieve by linear programming on the basis of minZ value, can calculate the quantity x that each emission node must be launched a guided missile to relevant destination node _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 _iAt 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 again and finish the spent shortest time T of whole MISSILE LAUNCHING task, thereby realize that the commander that the battle-field guided missile firepower is distributed fast controls, 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{v=1}{\overset{n_e}{\mathrm{\Σ}}}{D}_v{y}_v+\underset{v=n_e+1}{\overset{n_l}{\mathrm{\Σ}}}{D}_v{y}_v+\underset{v=n_l+1}{\overset{n_s}{\mathrm{\Σ}}}{D}_v{y}_v+\underset{u=n_s+1}{\overset{m_e}{\mathrm{\Σ}}}{S}_u{y}_u+\underset{u=m_e+1}{\overset{m_l}{\mathrm{\Σ}}}{S}_u{y}_u+\underset{u=m_l+1}{\overset{m_s}{\mathrm{\Σ}}}{S}_u{y}_u$

Constraint condition: $D_e{y}_{n_e\left(j\right)}+D_l{y}_{n_l\left(j\right)}+D_s{y}_{n_s\left(j\right)}+S_e{y}_{m_e\left(i\right)}+S_l{y}_{m_l\left(i\right)}+S_s{y}_{m_s\left(i\right)}\≤d_{\mathrm{ij}}$ (i＝1，…，m；j＝1，…，n)

Condition of Non-Negative Constrains: $y_{m_l\left(i\right)},y_{n_l\left(j\right)}\≤0$ (i＝1，…，m；j＝1，…，n)

Non-positive constraint condition: $y_{m_s\left(i\right)},y_{n_s\left(j\right)}\≥0$ (i＝1，…，m；j＝1，…，n)

Wherein:

$y_{n_e\left(j\right)}=y_v(1\≤v\≤n_e),y_{n_l\left(j\right)}=y_v(n_e+1\≤v\≤n_l),y_{n_s\left(j\right)}=y_v(n_l+1\≤v\≤n_s)$ Be the variable subscript sequence number transforming function transformation function relevant with j;

$y_{m_e\left(i\right)}=y_u(n_s+1\≤u\≤m_e),y_{m_l\left(i\right)}=y_u(m_e+1\≤u\≤m_l),y_{m_s\left(i\right)}=y_u(m_l+1\≤u\≤m_s)$ Be the variable subscript sequence number transforming function transformation function relevant with i;

y _v, y _u(v=1 ..., n _sU=n _s+ 1 ..., m _s) be 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 _vAnd y _uReflection 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 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, commander's control method that battle-field guided missile firepower according to claim 1 distributes fast, 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 without hindrance flight probability of flight path, 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 is commander's controlling models of target with all missile flights minimum that expends time in of emission, 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 option control command that the battle-field guided missile firepower distributes time requirement fast until final acquisition is meant if the option control command of trying to achieve can not satisfy the preset time requirement, then can be by two dimension commander control table, result to former linear programming and dual program analyzes, determine to influence the battle-field guided missile bottleneck of flight time accumulation, 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 flying speeds, eliminate the time bottleneck, and repeat this process, the predetermined requirement that meets T.T. until the battle-field guided missile flight of launching, this process can be described with following example, but the mathematical formulae described in example, result of calculation, various forms and application process are applicable to quick commander's control that all battle-field guided missile firepower are distributed fast

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 6 launching site to 14 target emission specified amounts, the emission and destination node between the missile flight path length, can launch and the bound of demand guided missile quantity as shown in table 1, make the without hindrance flight Probability p in all missile flight paths here _Ij(t) be 1, d _Ij=r _Ij/ p _Ij(t), therefore the real missile flight path length between difference emission and destination node equates with equivalent missile flight path, i.e. r _IjWith d _IjEquate,

Table 1: 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 06 launching site The demand upper limit The demand lower limit 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 60.00 19.00 56.00 30.00 48.00 65.00 75.00 30.00 69.00 70.00 26.00 65.00 72.00 44.00 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 90.00 30.00 35.00 28.00 36.00 21.00 90.00 130.00 70.00 40.00 60.00 16.00 29.00 36.00 80.00 20.00 25.00 22.00 Can send out the upper limit 100.00 200.00 300.00 400.00 150.00 350.00

Can give limit 100.00 60.00 40.00 10.00 10.00 20.00

According to above-mentioned linear programming and commander controlling models and relevant dual linear programming model, as shown in table 2 by certain combat troop's minimum time guided missile Fire Distribution option control command that simplex algorithm calculates,

Table 2: certain combat troop's minimum time guided missile Fire Distribution option control command (unit: piece, piece kilometer, batch, second) 01 launching site 02 launching site 03 launching site 04 launching site 05 launching site 06 launching site Piece kilometer Salvo batch Expend time in Upper limit shadow valency Lower limit shadow valency 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 30.00 70.00 36.00 60.00 64.00 40.00 60.00 36.00 80.00 22.00 29.00 20.00 25.0 21.00 66.00 16.00 468.00 399.00 2430.00 2940.00 1820.00 800.00 720.00 480.00 725.00 1656.00 1360.00 540.00 275.00 440.00 3 2 6 9 5 3 4 1 2 3 5 2 2 2 11.14 16.29 24.00 25.71 22.29 17.14 10.29 25.71 21.43 39.43 14.57 23.14 9.43 17.14 13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 0.00 0.00 0.00 0.00 13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 17.00 27.00 11.00 20.00 Add up to 100.00 200.00 198.00 29.00 45.00 103.00 15053.00 49 39.43 ^* But emission measure 100.00 200.00 300.00 400.00 150.00 350.00 Send out the back surplus 0.00 0.00 102.00 371.00 105.00 247.00 Upper limit shadow valency 0.00 0.00 0.00 0.00 0.00 0.00 Lower limit shadow valency 0.00 0.00 0.00 0.00 0.00 0.00

* finish the minimum time that the MISSILE LAUNCHING task expends

By option control command (table 2) is analyzed as can be known; finish salvo that the MISSILE LAUNCHING task needs and batch add up to 49; time was 39.43 seconds; the salvo that 01～06 launching site needs batch is respectively 11; 16; 14; 2; 4 and 12; therefore must be to 02; 03 and 06 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 36 pieces of 39.43 seconds that guided missile spent of 10 impact points emission; 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 25.71 seconds; reduction is 34.80%

From to target requirement amount constraint condition D _v(v=1,18) 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, relevant constraint condition does not constitute influence to target function value, the easiest to be satisfied, promptly this resource is not in short supply, if increase this resource again the optimal value of objective function is further reduced, again for example, in order to satisfy constraint condition D ₁₀, to launch a guided missile 39.43 seconds consuming time to 10 impact points, the shadow price of this constraint condition is a maximal value 37, illustrates that this condition is the most difficult satisfied, can be by D with similar method _vThe complexity that satisfies, from difficulty to easy ordering: D ₁₀, D ₈, D ₁₆, D ₅, D ₃, D ₉..., to emission measure constraint condition S _u(u=19 ..., 29) analysis of shadow price as can be known, their shadow price is 0, therefore, in specific span, changes S _uValue target function value is not constituted influence, must be pointed out that shadow price is not changeless, can be along with D _vAnd S _uVariation and change, make the resource that does not constitute influence originally become influential resource, by analysis to shadow price, can adjust constraint condition targetedly, reach and reduce carrying capacity and finish the purpose that the MISSILE LAUNCHING task needs the time, because shadow price is the result who obtains under specific constraint condition, only in its valid interval, price just has relative stability

Can launch a guided missile quantity as can be seen from the residue of each launching site of back of finishing the work, launching a guided missile of 02 launching site exhausts, obviously on the low side, and the launched a guided missile amount of 04 launching site is obviously bigger than normal, according to the antithesis analysis, the shadow price of their constraint condition is 0, this statement of facts: can launch a guided missile if 02 launching site has more, 04 launching site has launching a guided missile still less, just may obtain better to command control plan, so adjust the upper limit S of constraint condition targetedly ₂₅Be increased to 400 from 200, make S simultaneously ₂₇Reduce to 200 from 400, the improvement project of certain combat troop's minimum time guided missile Fire Distribution option control command of obtaining is as shown in table 3,

Table 3: the improvement project (unit: piece, piece kilometer, batch, second) of certain combat troop's minimum time guided missile Fire Distribution option control command 01 launching site 02 launching site 03 launching site 04 launching site 05 launching site 06 launching site Piece kilometer Salvo batch Expend time in Upper limit shadow valency Lower limit shadow valency 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 30.00 70.00 36.00 60.00 130.00 40.00 36.00 60.00 80.00 22 29.00 20.00 25.00 21.00 16.00 468.00 399.00 2430.00 1950.00 1820.00 800.00 720.00 480.00 725.00 1332.00 1360.00 540.00 275.00 440.00 3 2 6 9 5 3 4 1 2 3 5 2 2 2 11.14 16.29 24.00 12.86 22.29 17.14 10.29 25.71 21.43 31.71 14.57 23.14 9.43 17.14 13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 0.00 0.00 0.00 0.00 13.00 19.00 25.00 14.00 26.00 20.00 12.00 30.00 25.00 37.00 17.00 27.00 11.00 20.00 Add up to 100.00 302.00 162.00 29.00 45.00 37.00 13739.00 49 31.71 ^* But emission measure 100.00 400.00 300.00 200.00 150.00 350.00 Send out the back surplus 0.00 98.00 138.00 171.00 105.00 313.00 Upper limit shadow valency 0.00 0.00 0.00 0.00 0.00 0.00 Lower limit shadow valency 0.00 0.00 0.00 0.00 0.00 0.00

* finish the minimum time that the MISSILE LAUNCHING task expends

Analysis by his-and-hers watches 3 as can be known, the time that finishing the MISSILE LAUNCHING task needs shortens to 31.71 minutes, amount of decrease is 19.58%, total carrying capacity is reduced to 13739 pieces of kilometers, and amount of decrease is 8.73%, and antithesis the analysis showed that: shadow price is without any variation, but the scheme after improving is better, therefore, can also carry out reasonable configuration to the launched a guided missile quantity of each launching site, can the launch a guided missile Optimal Management of quantity of realization with said method.