CN1818953A - Resource linear planning optimizing distribution of combined operation information war - Google Patents
Resource linear planning optimizing distribution of combined operation information war Download PDFInfo
- Publication number
- CN1818953A CN1818953A CN 200610038857 CN200610038857A CN1818953A CN 1818953 A CN1818953 A CN 1818953A CN 200610038857 CN200610038857 CN 200610038857 CN 200610038857 A CN200610038857 A CN 200610038857A CN 1818953 A CN1818953 A CN 1818953A
- Authority
- CN
- China
- Prior art keywords
- information war
- resource
- war resource
- information
- optimum allocation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Abstract
A information war resource linear programming most superior assign method of combined operations, belongs to the military and the correlative field, the object of the most superior assignment is the information war resource of the combined operations, the method is: define the property of the information war resource assignment and the information war battle effectiveness, construct the assignment rules of the information war resource, setup the model of the most superior assignment of the information war resource according to the battle effectiveness needing guideline of the information war resource, use the linear programming method to find the module, finally get the most superior assignment project according to the needing of the information war resource. The characteristics of the method is high-effective, simple, objective, wide application and improving the battle effectiveness markedly, the method can widely use for the most superior assignment of the combined operations information war resource.
Description
Technical field the present invention relates to national defence and association area, is used for the information war resource of combined operation is carried out the linear programming optimum allocation, realizes the scientific management to the information war resource of combined operation.
Background technology worldwide, information war or information fighting are becoming the main patterns of warfare and the important means that combined operation are improved its combat capabilities, be subjected to extensive concern in campaign and tactics research field, and how the information war resource of combined operation is distributed is a difficult problem that faces in the campaign of combined operation and the tactics research always, the solution of this problem is for the whole fighting capacity that increases substantially combined operation, minimizing has crucial meaning to the demand of expensive information war resource.
In the information war resource, there are difference in essence in some resource and other traditional operating resources.At first, these information war resources have multiple fighting capacity feature usually, and the fighting capacity of various ways promptly can be provided; Secondly, these information war resources can realize distributing fast and sharing by means of network interconnection or information transfer capacity in big geographical regional extent usually, and the fighting capacity of formation can breakthrough time and the restriction in space.For example: can be by single information war resource is quantitatively adjusted, make the information war resource of distribution reach the cost optimum on the whole, compare with traditional operating resources, this optimum allocation to the information war resource can obtain to compare the higher remuneration of optimum allocation of traditional operating resources.
Expansion along with the maneuverability and the scope of combined operation, become complicated more for combined operation provide the task of the guarantee of information war resource fast, wherein outstanding contradiction is exactly how to make the bigger effect of finite information war resource performance and how to make these information war resource performances break through the advantage of space-time restriction.
On the other hand, the network-centric warfare environment has also proposed an urgent demand to the optimum allocation of information war resource, because by means of networked environments, can realize the information war resources allocation more easily, thereby make the improper information war risk that resources allocation caused also become big, so the quality of information war resource optimum allocation has more importantly influence to the fighting capacity of network-centric warfare thereupon.Therefore, the key character and the needs of network-centric warfare are not only in the optimum allocation of information war resource, and are one of network-centric warfare key issue that must solve.
In recent years, owing to be subjected to the distribution method of information war resource and to the description of information war resource and the restriction of quantization method, to the progress of the assignment problem of information war resource seldom, in fact the distribution of the information war resource of combined operation is an outstanding issue so far always.It has been generally acknowledged that fully the satisfy the demands distribution method that gets final product of information war resource not only causes the huge waste of finite information war resource, but also cause the demand of information war resource is not being met on some region of war, make the information war resource become the bottleneck that restriction fighting capacity improves, thereby cause the passive situation on the battlefield, so must seek the assignment problem that new method solves the information war resource.
The present invention relates to the information war resource linear planning optimizing distribution of combined operation, relate to military affairs and association area, the optimum allocation object is the information war resource of combined operation.This method at first defines the distribution of information war resource and the fighting capacity attribute of information war resource, construct then the information war resource is carried out distribution criterion, and according to index to information war fighting capacity demand, foundation is to the model of information war resource optimum allocation, and find the solution this model with linear programming method, the final scheme that obtains according to demand the optimum allocation of information war resource, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in the optimum allocation of the information war resource of all combined operation, the invention further relates to the technology that realizes this method.
Summary of the invention the present invention at first defines the attribute of the fighting capacity that information war resource and each information war resource had, again according to the demand of battlefield to various different information war fighting capacity, set up the relevant linear programming model that is used for the optimum allocation of information war resource of demand therewith, and by finding the solution this model, the final optimum allocation that obtains the information war resource.Therefore, the conception of information war resource optimum allocation is proposed, the attribute of the fighting capacity of definition information war resource, set up with the information war resource and to the relevant information linear programming model of optimum allocation of the relevant information war resource of fighting capacity demand of fighting, and find the solution this model and become key character of the present invention.
The technical scheme of resource linear planning optimizing distribution of combined operation information war of the present invention is:
At first, with the information war resources definition is the decision variable with some information war fighting capacity attributes, consider that simultaneously the price that different information war resources is had may be different with the fighting capacity attribute, and the target that supposition is carried out optimum allocation to the information war resource is under the constraint condition of given information war Index of Combat Effectiveness, and the total price that makes the information war resource of final assignment is minimum (can suppose that also other carries out the target of optimum allocation to the information war resource).Secondly, when considering the constraint of information war Index of Combat Effectiveness, the amount of supposing the corresponding fighting capacity attribute of all information war resources can linear superposition, and the result of stack must meet the restriction that corresponding information war Index of Combat Effectiveness is applied, claim that this logical relation that restriction constituted by stack result and information war Index of Combat Effectiveness is the constraint condition of an information war Index of Combat Effectiveness of information war resource optimum allocation objective function, can construct a plurality of different constraint conditions according to the difference to the Index of Combat Effectiveness of the fighting capacity attribute of information war resource, all these constraint conditions have just constituted the linear restriction relation equation group of objective function.At last, can use the linear programming method for solving, find the solution Algebraic Equation set or model that objective function and constraint condition by the optimum allocation of information war resource constitute, can obtain optimum allocation result the information war resource.
The optimum allocation of research information war resource, usually must consider information war resource and information war resource specific implementation or and the relation of information war between equipping, because the information war equipment is the specific implementation form of information war resource, difference according to the fighting capacity attribute of information war resource itself, can regard the information war equipment as form an information war unit by the tactics of physical equipment, related personnel and employing, therefore, to the optimum allocation of information war resource, in fact be exactly optimum allocation to information war equipment itself.
The information war resource optimum allocation method of the invention is to realize with relevant constraint condition Algebraic Equation set by finding the solution the objective function of implementing optimum allocation, and the fighting capacity of information war resources allocation is required is to realize by the restriction that different fighting capacity attribute algebraic expressions is applied corresponding Index of Combat Effectiveness, so just the optimum allocation of information war resource with set up a kind of corresponding restriction relation between fighting capacity to the information war resources allocation requires, thereby the result who guarantees optimum allocation meets given fighting capacity requirement.
The resource linear planning optimizing distribution of combined operation information war of the present invention's design is applicable to that the optimum allocation of the information war resource of all combined operation is key characters of the present invention.
For specific operation pattern, can be in the hope of in the information war resource that needs in this pattern, various fighting capacity resources are shared best proportion in the total information war resource of distributing, and then according to this best proportion, whole information war resource is carried out allocation optimum, therefore also can regard the optimal assignment problem of information war resource the optimization formula problem of various fighting capacity resources in the information war resource as.The information war resource linear planning optimizing distribution can further describe as follows.
Definition x
i(i=1 ..., n) decision variable, a for information war resource i is carried out optimum allocation
IjBe the information war resource
iFighting capacity
j(j=1 ..., content m), b
jThe information war resource of distributing for hope the
jThe Index of Combat Effectiveness that individual fighting capacity attribute reaches, c
iBe the information war resource
iPrice, then definable by objective function and constraint system of equations linear programming model that constitute, that be used for n information war resource carried out optimum allocation is:
Objective function MinZ is the cost minimization that makes the information war resource:
MinZ＝c
1x
1+…+c
nx
n
The equation of constraint group is:
a
11x
1+a
12x
2+…+a
1nx
n≥b
1(＝，≤b
1)
a
21x
1+a
22x
2+…+a
2nx
n≥b
2(＝，≤b
2)
…
a
m1x
1+a
m2x
2+…+a
mnx
n≥b
m(＝，≤b
m)
x
1≥0，x
2≥0，…，x
n≥0
Find the solution above-mentioned linear programming model by simplex algorithm, can obtain the optimum allocation result or the prescription of information war resource.Therefore, 5 condition precedents of application linear programming are in the optimum allocation of information war resource:
(1) severability
The information war resource (decision variable) that all are assigned with can resolve into the significant part of any size or be made up of the significant part of any size, can resolve into different information war fighting capacity and partly or by different information war fighting capacity part institutes be formed.
(2) direct proportion
For aritrary decision variable x
i, its contribution to cost is c
ix
i, be a to the contribution of j kind fighting capacity
Ijx
iIf, with x
iAmount double, also should double to cost or to the contribution of fighting capacity composition so.
(3) additive property
The total cost of the information war resource of distributing is the cost sum of each information war resource, and the information war resource of distribution is the contribution sum of a plurality of information war resources to total contribution of j constraint.
(4) consistency of axioms
In linear programming, should there be mutual repellency, co-operation together between the information war resource of Fen Peiing together.
(5) nonrandomness
All c
i, a
IjAnd b
jAll be known, deterministic, rather than at random.
In addition, by the analysis to the dual program of above-mentioned primal linear programming, can study the economic cost of each fighting capacity binding target in the primal linear programming problem, this cost is also referred to as shadow price.For the optimal assignment problem of information war resource,, can carry out following quantitative test by finding the solution its dual problem:
(1) can calculate the real economy of various information war resources in optimum allocation or optimization formula according to shadow price is worth.Obviously, all information war resources that is selected into optimum allocation or optimization formula, inevitable war (city) price of its economic worth more than or equal to it, on the contrary this information war resource will fail to be elected.Therefore the decision maker can judge, when which kind of level is the price of selected information war resource rise to, the proportioning of this information war resource will descend even can not continue use in relevant optimum allocation or the optimization formula, and which kind of level unelected information war resource price when dropping to, and being selected into optimum allocation again will make a profit certainly.
(2) provide the price effective range of the various information war resources of forming optimum allocation, when the price of information war resource changes in this scope, the optimum allocation result will remain unchanged, in case the price of information war resource surpasses its effective range, then need to carry out again optimum allocation, minimum to guarantee cost.
(3) valid interval of calculating Index of Combat Effectiveness, the shadow price of multiple Index of Combat Effectiveness is constant in this is interval, and this moment, Index of Combat Effectiveness reduced a unit value, and the information war resources costs reduction value of distribution equals the shadow price of this fighting capacity composition.The decision maker can seek certain information war resource that the effective way that reduces cost or selection have economic benefit in view of the above.
For veneziano model by linear programming model, further analyze the architectural feature of separating of above-mentioned linear programming model, definition is the decision variable y that describes m fighting capacity key element by objective function and constraint system of equations veneziano model that constitute, above-mentioned linear programming model
j(j=1 ..., linear programming model m):
Objective function MaxG reaches maximization for making the fighting capacity content's index:
MaxG＝b
1y
1+…+b
my
m
The equation of constraint group is:
a
11y
1+a
21y
2+…+a
m1y
m≤c
1
a
12y
1+a
22y
2+…+a
m2y
m≤c
2
…
a
1ny
1+a
2ny
2+…+a
mny
m≤c
m
y
1≥0，y
2≥0，…，y
m≥0
Decision variable y wherein
j(j=1,2 ..., m) for waiting to ask the Index of Combat Effectiveness b of information war resource
j(j=1,2 ..., shadow price m) or opportunity cost.
Find the solution above-mentioned dual linear programming model by simplex algorithm, can finish antithesis analysis above-mentioned primal linear programming.
Under network center's environment, the information war resource can realize all or part of quick distribution, and this being distributed in fast is quick distribution to the fighting capacity attribute of information war resource in essence, and the common fighting capacity that can distribute fast has target reconnaissance, targeted surveillance, goal-based assessment and to processing of target information etc.Since each information war resource all may and a certain concrete information war equipment or troops between have corresponding relation, and may have fighting capacity partly or entirely, also be quick optimum allocation in itself to the quick optimum allocation of information war resource to relevant information war equipment or troops.
Must be pointed out: in the process of actual information war resource optimum allocation, finally to implement to the optimum allocation of information war resource the branch of information war equipment or troops is mixed, therefore must consider that information war equipment or troops itself measure with integer, and the solving result of above-mentioned linear programming is equipped by information war or the quantity of troops is non-integer, so just might make this non-integer allocation result in concrete realization by integer, thereby have influence on the correctness of linear programming optimum solution.But on the other hand, can realize under network center's environment that the information war that distributes is fast equipped or the value of the fighting capacity attribute of troops own can be in the certain limit adjustment, therefore the non-integer allocation result in fact also can realize, so just can guarantee the correctness of optimum allocation result in specific implementation.
Embodiment
Embodiment 1
The information war resource linear programming optimum allocation of combined operation.
Supposition now must be carried out optimum allocation to the information war resource of combined operation in a typical campaign planning, consider 11 information war resources altogether, and the fighting capacity of each information war resource can be described with 9 fighting capacity attributes, wherein y
1And y
2Relevant with battlefield target reconnaissance ability or fighting capacity, y
3And y
4Relevant with battlefield targeted surveillance fighting capacity, y
5And y
6Relevant with the battlefield to target strike effect assessment (BDA) fighting capacity, y
7And y
8Relevant with the battlefield to target information processing fighting capacity, y
9Relevant with battle field information transmission fighting capacity, and for each fighting capacity attribute, its relevant Index of Combat Effectiveness is as the part of constraint condition, further the information war resource of all participation optimum allocations of supposition all is assignable, for example under network center's environment, distribute fast, so just guaranteed the feasibility of quick optimum allocation.Therefore, according to the fighting capacity property value of above-mentioned linear planning optimizing distribution and all information war resources, the constraint condition part of linear programming model that can be configured to the optimum allocation of information war resource is as shown in table 1.
Table 1 is used for the constraint condition part of the linear programming model of information war resource optimum allocation
| x 1 | x 2 | x 3 | x 4 | x 5 | x 6 | x 7 | x 8 | x 9 | x 10 | x 11 | S.L. | b j | |
| y 1 y 2 y 3 y 4 y 5 y 6 y 7 y 8 y 9 x 1 x 2 x 11 x 3 x 4 Pre | 3.24 8.50 0.02 0.27 0.12 0.00 0.18 0.38 0.24 1.00 0.00 0.00 0.00 0.00 1.00 | 2.35 44.0 0.33 0.62 0.18 0.00 0.62 1.30 2.66 0.00 0.00 0.00 0.00 0.00 1.00 | 2.03 43.50 0.28 1.04 0.36 0.00 0.58 1.26 1.97 0.00 0.00 0.00 -1.00 0.00 1.00 | 2.91 62.50 3.96 3.05 3.05 3.00 1.66 2.21 5.12 0.00 1.00 0.00 0.00 -1.00 1.00 | 0.00 0.10 23.20 16.50 16.50 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 35.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 0.00 0.00 0.00 0.00 99.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 78.80 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 0.00 0.00 0.00 99.00 0.00 99.0 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 9.66 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 0.00 0.00 1.00 | ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＝ ＞＝ ＞＝ ＞＝ ＞＝ ＝ | 2.90 21.00 1.00 0.65 0.45 0.37 0.45 0.84 1.09 0.60 0.02 0.01 -0.03 -0.05 1.00 |
Wherein S.L. is the logical relation computing in the constraint condition, and Pre represents each information war resource of participating in the distribution portion in the total information war resource of optimum allocation for proportioning constraint condition.
The objective function of the information war resource optimum allocation that structure is relevant is:
MinZ＝1.02x
1+1.95x
2+0.96x
3+4.2x
4+1.35x
5
+0.12x
6+21x
7+15x
8+0.6x
9+3.95x
10+8x
11
Wherein: the optimum allocation amount of various information war resources to be asked or select ratio x for use
i(i=1,2 ..., 11) preceding coefficient is the price of information war resource (1,000 ten thousand yuan/unit resource).
The 3rd of table 2 is classified the optimum allocation result or the prescription of the information war resource of obtaining by the simplex algorithm of finding the solution linear programming model as, least cost 1519.4 (ten thousand yuan).
Table 2 is used for the optimum solution of the linear programming model of information war resource optimum allocation
| The information war resource | Unit resource price (1,000 ten thousand yuan) | Full price lattice resource (%) |
| x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11Add up to | 1.02 1.95 0.96 4.20 1.35 0.12 21.00 15.00 0.60 3.95 8.00 1.5194 | 60.00 28.16 3.00 3.53 1.27 1.29 0.13 - 0.27 1.35 1.00 100.00 |
Embodiment 2
The antithesis analysis of the information war resource linear programming optimum allocation of combined operation.
The objective function of the veneziano model of embodiment 1 neutral line plan model is:
MaxG＝2.9y
1+21y
2+1.0y
3+0.65y
4+0.45y
5
+0.37y
6+0.45y
7+0.84y
8+1.09y
9+60y
10
+2.0y
11-3.0y
12-5.0y
13+100y
14
Therefore, according to the relation between above-mentioned linear programming and its dual program, the veneziano model constraint condition of linear programming model that can be configured to the optimum allocation of information war resource is as shown in table 3.
The veneziano model constraint condition of table 3 linear programming model
| y 1 | y 2 | y 3 | y 4 | y 5 | y 6 | y 7 | y 8 | y 9 | x 1 | x 2 | x 11 | x 3 | x 4 | Pre | S.L. | c i | |
| x 1 x 2 x 3 x 4 x 5 x 6 x 7 x 8 x 9 x 10 x 11 b j | 3.24 2.35 2.03 2.91 0.00 0.00 0.00 0.00 0.00 9.66 0.00 2.90 | 8.50 44.00 43.50 62.50 0.00 0.00 0.00 0.00 0.00 0.00 0.00 21.00 | 0.02 0.33 0.28 3.96 23.20 35.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.27 0.62 1.04 3.05 16.50 0.00 0.00 0.00 0.00 0.00 0.00 0.65 | 0.12 0.18 0.36 3.05 16.50 0.00 0.00 0.00 0.00 0.00 0.00 0.45 | 0.00 0.00 0.00 3.0 0.00 0.00 0.00 0.00 99.00 0.00 0.00 0.37 | 0.18 0.62 0.58 1.66 0.00 0.00 99.00 0.00 0.00 0.00 0.00 0.45 | 0.38 1.30 1.26 2.21 0.00 0.00 99.00 0.00 0.00 0.00 0.00 0.84 | 0.24 2.66 1.97 5.12 0.00 0.00 0.00 78.8 0.00 0.00 0.00 1.09 | 1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 60.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 2.00 | 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 1.00 | 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -3.00 | 0.00 0.00 0.00 -1.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00 -5.00 | 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 1.00 | ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ ＜＝ | 1.02 1.95 0.96 4.20 1.35 0.12 21.00 15.00 0.60 3.95 8.00 |
Data representation decision variable of last column of table 3 and shadow price y
j(j=1,2 ..., coefficient m).Can find the solution the linear programming problem that table 3 and related objective function are constituted with simplex method, the result who finds the solution is listed in table 4 for the fighting capacity project that participates in optimizing and to " shadow price " of the information war resource of the restricted effect of fighting capacity project demands amount.
Table 4 optimization formula diagnostic result and shadow price
| The fighting capacity component | Unit | The way of restraint | Standard-required | Actual reaching | Shadow price |
| y 1 y 2 y 3 y 4 y 5 y 6 y 7 y 8 y 9 x 1 x 2 x 11 x 3 x 4 | (％) (％) (％) (％) (％) (％) (％) (％) (％) (％) (％) (％) (％) (％) | ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＞＝ ＝ ＞＝ ＜＝ | 2.90 21.00 1.00 0.65 0.45 0.37 0.45 0.84 1.09 0.21 1.00 60.00 2.00 3.00 | 2.90 21.00 1.00 0.69 0.45 0.37 0.45 0.84 1.12 0.26 1.00 60.00 3.17 3.00 | 29.21 0.00 0.34 0.00 7.70 0.61 21.21 0.00 10.93 0.00 8.00 0.00 2.17 0.91 |
In table 4, last row data presented is the optimum solution of the dual problem shown in the table 3, because original linear programming is the optimal assignment problem that is used for asking the information war resource, dual problem is then estimated b
j(j=1,2 ..., m) use the valency problem.According to economic definition, b
j(j=1,2 ..., value m) also can be regarded resource as, and this just means in the linear programming formulation model, and " resource " is meant that those participate in the fighting capacity component of computation optimization or to the conditional information war resource of consumption, and veneziano model solving result y
j(j=1,2 ..., m) then corresponding successively " resource " b
j(j=1,2 ..., " shadow price " m), promptly veneziano model is exactly " shadow price " of finding the solution specific resources, and " shadow price " can reflect the opportunity cost of information war resource.Therefore, the implication of shadow price is: when improving or reducing the Index of Combat Effectiveness that participates in calculating and wish finally to reach, and the influence degree that is produced to the least cost that satisfies the optimization formula that obtains under the new constraint condition.Shadow price is big more, illustrates that its least cost influence to prescription is also big more, and the realization of indication Index of Combat Effectiveness is difficult more.Notice that shadow price is a relative value rather than absolute value.The analysis conclusion of the shadow price of his-and-hers watches 4 is as follows:
(1) shadow price is that the Index of Combat Effectiveness of 0 information war resource is meant that in specific span reaching of this Index of Combat Effectiveness do not constitute influence to target function value.For example in this example, y
4And y
9Standard-required be 0.65 and 1.09, but the actual value of reaching is 0.69 and 1.12, shows that the realization of these two indexs attaches up when satisfying other implacable index, so its shadow price is 0.
(2) to the analysis showed that of shadow price, the Index of Combat Effectiveness that participates in the information war resource of optimum allocation reaches standard-required ordering from the difficult to the easy and is: y
1(29.21), y
7(21.21), y
9(10.93), x
2(8.00), y
5(7.70), x
3(2.17), x
4(0.91), y
6(0.61), y
3(0.34).
The decision maker can seek to reduce the effective way of information war resources costs or certain information war resource that selection has economic benefit in view of the above.
Claims (8)
1, the present invention relates to the information war resource linear planning optimizing distribution of combined operation, relate to military affairs and association area, the optimum allocation object is the information war resource of combined operation, at first define the distribution of information war resource and the fighting capacity attribute of information war resource, construct then the information war resource is carried out distribution criterion, and according to index to information war fighting capacity demand, foundation is to the model of information war resource optimum allocation, and find the solution this model with linear programming method, the final optimal distributing scheme that obtains according to demand the information war resource, this method has efficiently, simply, objective, characteristics are widely used and obviously improve its combat capabilities etc., can be widely used in the optimum allocation of the information war resource of all combined operation, the invention further relates to the technology that realizes this method.
2, the information war resource linear planning optimizing distribution of combined operation according to claim 1, it is characterized in that information war resource that described optimum allocation object is combined operation is meant the information war resource of the combined operation object as optimum allocation, actual demand according to region of war or operation, optimum allocation partial information war resource is given region of war or operation from this object, what promptly solve is according to actual needs, optimum allocation partial information war problem of resource from overall information war resource.
3, the information war resource linear planning optimizing distribution of combined operation according to claim 1, when it is characterized in that information war resource that described optimum allocation object is combined operation is meant the optimum allocation of research information war resource, usually must consider information war resource and information war resource specific implementation or and the relation of information war between equipping, because the information war equipment is the specific implementation form of information war resource, difference according to the fighting capacity attribute of information war resource itself, the information war equipment can be regarded as by physical equipment, the information war unit that the tactics of related personnel and employing are formed, therefore, to the optimum allocation of information war resource, in fact be exactly optimum allocation to information war equipment itself.
4, the information war resource linear planning optimizing distribution of combined operation according to claim 1, the fighting capacity attribute that it is characterized in that described distribution that at first defines the information war resource and information war resource is meant in the part of resource that overall information is fought distributes to the region of war, when operation or other object, think that the information war resource has multiple fighting capacity or has multiple fighting capacity attribute, and the percentage that is used in different information war fighting capacity contained in the unit information war resource comes the information war fighting capacity attribute of quantitative description information war resource, be that the information war resource is a kind of resource with multiple information war fighting capacity or fighting capacity attribute, this also is the important foundation that the information war resource can be carried out optimum allocation.
5, the information war resource linear planning optimizing distribution of combined operation according to claim 1, it is characterized in that described the structure then carry out distribution criterion to the information war resource and be meant that distribution portion information war resource is carried out according to some predetermined criteria or rule from overall information war resource, the distribution of satisfying these criterions or rule to greatest extent is also referred to as optimum allocation, and the functional form of these criterions or rule is called the objective function of implementing optimum allocation, and can set up different criterions or rule according to actual needs on their own, for example: in order to guarantee most economical use to overall information war resource, can set up the minimum cost objective function relevant with " most economical using priciple " and implement optimum allocation, promptly distribution portion information war resource is finished as target by predetermined criteria or rule from overall information war resource.
6, the information war resource linear planning optimizing distribution of combined operation according to claim 1, it is characterized in that described and according to index to information war fighting capacity demand, foundation is meant concerning a side of information war resource requirement the model of information war resource optimum allocation, can be according to the actual demand of its region of war, place or operation, proposition (can be passed through Combat Simulation usually to the specific requirement of information war fighting capacity, experimental formula or other any way are determined the real needs to information war fighting capacity), these demands are then in the optimum allocation of information war resource, be used as the constraint condition that optimum allocation must be satisfied, and then on the basis of the constraint condition of the objective function of optimum allocation and optimum allocation, the model of structure implementation information war resource optimum allocation, promptly having the objective function of optimum allocation and the constraint condition of optimum allocation is the key character of information war resource optimal allocation model.
7, the information war resource linear planning optimizing distribution of combined operation according to claim 1, it is characterized in that described and find the solution this model with linear programming method, the final optimal distributing scheme that obtains according to demand the information war resource is meant and following the information war resource is carried out the linear programming equation of optimum allocation and by finding the solution the optimal distributing scheme of the information war resource that this equation obtains, but following mathematical formulae, derivation, result of calculation and application process are applicable to the optimum allocation to the information war resource of all combined operation
For specific operation pattern, can be in the hope of in the information war resource that needs in this pattern, various fighting capacity resources are shared best proportion in total information war resource, and then according to this best proportion, whole information war resource is carried out allocation optimum, therefore also can regard the optimal assignment problem of information war resource the optimization formula problem of various fighting capacity resources in the information war resource as, the information war resource linear planning optimizing distribution can further describe as follows
Definition x
i(i=1 ..., n) decision variable, a for information war resource i is carried out optimum allocation
IjBe the information war resource
iFighting capacity
j(j=1 ..., content m), b
jThe information war resource of distributing for hope the
jThe Index of Combat Effectiveness that individual fighting capacity attribute reaches, c
iBe the information war resource
iPrice, then definable by the linear programming model that objective function and constraint system of equations constitute, are used for n information war resource carried out optimum allocation is:
Objective function MinZ is the cost minimization that makes the information war resource:
MinZ＝c
1x
1+…+c
nx
n
The equation of constraint group is:
a
11x
1+a
12x
2+…+a
1nx
n≥b
1(＝，≤b
1)
a
21x
1+a
22x
2+…+a
2nx
n≥b
2(＝，≤b
2)
…
a
m1x
1+a
m2x
2+…+a
mnx
n≥b
m(＝，≤b
m)
x
1≥0，x
2≥0，…，x
n≥0
Find the solution above-mentioned linear programming model by simplex algorithm, can obtain the optimum allocation result or the prescription of information war resource, therefore, 5 condition precedents using linear programming in the optimum allocation of information war resource are:
(1) severability
The information war resource (decision variable) that all are assigned with can resolve into the significant part of any size or be made up of the significant part of any size, can resolve into different information war fighting capacity partly or by different information war fighting capacity part institutes is formed
(2) direct proportion
For aritrary decision variable x
i, its contribution to cost is c
ix
i, be a to the contribution of j kind fighting capacity
Ijx
iIf, with x
iAmount double, also should double to cost or to the contribution of fighting capacity composition so,
(3) additive property
The total cost of the information war resource of distributing is the cost sum of each information war resource, and the information war resource of distribution is the contribution sum of a plurality of information war resources to total contribution of j constraint,
(4) consistency of axioms
In linear programming, should there be mutual repellency between the information war resource of Fen Peiing together, co-operation together,
(5) nonrandomness
All c
i, a
IjAnd b
jAll be known, deterministic, rather than at random.
8, the information war resource linear planning optimizing distribution of combined operation according to claim 1, it is characterized in that described and find the solution this model with linear programming method, the final optimal distributing scheme that obtains according to demand the information war resource is meant that the former veneziano model that carries out the linear programming model of information war resource optimum allocation can be used to analyze the satisfaction degree of Index of Combat Effectiveness of master mould to the influence of the satisfaction degree of objective function, promptly be used for determining of the influence of the satisfaction degree of Index of Combat Effectiveness to the satisfaction degree of objective function, following mathematical formulae, derivation, result of calculation and application process are applicable to the antithesis analysis to the optimum allocation of the information war resource of all combined operation
By analysis to the dual program of above-mentioned primal linear programming, can study the economic cost of each fighting capacity binding target in the primal linear programming problem, this cost is also referred to as shadow price, optimal assignment problem for the information war resource, by finding the solution its dual problem, can carry out following quantitative test:
(1) can calculate the real economy of various information war resources in optimum allocation or optimization formula according to shadow price is worth, obviously, all information war resources that is selected into optimum allocation or optimization formula, inevitable war (city) price of its economic worth more than or equal to it, otherwise, this information war resource will fail to be elected, therefore the decision maker can judge, when which kind of level is the price of selected information war resource rise to, the proportioning of this information war resource will descend even can not continue use in relevant optimum allocation or the optimization formula, and which kind of level unelected information war resource price when dropping to, and being selected into optimum allocation again will make a profit certainly
(2) provide the price effective range of the various information war resources of forming optimum allocation, when the price of information war resource changes in this scope, the optimum allocation result will remain unchanged, in case the price of information war resource surpasses its effective range, then need to carry out again optimum allocation, minimum to guarantee cost
(3) valid interval of calculating Index of Combat Effectiveness, the shadow price of multiple Index of Combat Effectiveness is constant in this is interval, this moment, Index of Combat Effectiveness reduced a unit value, the information war resources costs reduction value of distributing equals the shadow price of this fighting capacity composition, the decision maker can seek certain information war resource that the effective way that reduces cost or selection have economic benefit in view of the above
For veneziano model by linear programming model, further analyze the architectural feature of separating of above-mentioned linear programming model, definition is the decision variable y that describes m fighting capacity key element by objective function and constraint system of equations veneziano model that constitute, above-mentioned linear programming model
j(j=1 ..., linear programming model m):
Objective function MaxG reaches maximization for making the fighting capacity content's index:
MaxG＝b
1y
1+…+b
my
m
The equation of constraint group is:
a
11y
1+a
21y
2+…+a
m1y
m≤c
1
a
12y
1+a
22y
2+…+a
m2y
m≤c
2
…
a
1ny
1+a
2ny
2+…+a
mny
m≤c
m
y
1≥0，y
2≥0，…，y
m≥0
Decision variable y wherein
j(j=1,2 ..., m) for waiting to ask the Index of Combat Effectiveness b of information war resource
j(j=1,2 ..., shadow price m) or opportunity cost,
Find the solution above-mentioned dual linear programming model by simplex algorithm, can finish antithesis analysis above-mentioned primal linear programming.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200610038857 CN1818953A (en) | 2006-03-15 | 2006-03-15 | Resource linear planning optimizing distribution of combined operation information war |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 200610038857 CN1818953A (en) | 2006-03-15 | 2006-03-15 | Resource linear planning optimizing distribution of combined operation information war |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1818953A true CN1818953A (en) | 2006-08-16 |
Family
ID=36918954
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 200610038857 Pending CN1818953A (en) | 2006-03-15 | 2006-03-15 | Resource linear planning optimizing distribution of combined operation information war |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1818953A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164746A (en) * | 2011-12-13 | 2013-06-19 | 中国人民解放军第二炮兵工程学院 | Emergency repair resource optimization decision-making method |
| CN111061995A (en) * | 2019-11-28 | 2020-04-24 | 江南机电设计研究所 | Combat resource allocation method, first equipment and second equipment |
-
2006
- 2006-03-15 CN CN 200610038857 patent/CN1818953A/en active Pending
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103164746A (en) * | 2011-12-13 | 2013-06-19 | 中国人民解放军第二炮兵工程学院 | Emergency repair resource optimization decision-making method |
| CN111061995A (en) * | 2019-11-28 | 2020-04-24 | 江南机电设计研究所 | Combat resource allocation method, first equipment and second equipment |
| CN111061995B (en) * | 2019-11-28 | 2023-06-09 | 江南机电设计研究所 | Combat resource allocation method, first equipment and second equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106327090A (en) | Real task allocation method applied to preference crowd-sourcing system | |
| Liang et al. | Assessing Urban Green Space distribution in a compact megacity by landscape metrics | |
| Gialis et al. | The diverse regional patterns of atypical employment in Greece: Production restructuring, re/deregulation and flexicurity under crisis | |
| CN1818953A (en) | Resource linear planning optimizing distribution of combined operation information war | |
| CN1818945A (en) | Resource linear planning optimizing distribution of air force information war | |
| CN1818951A (en) | Resource linear planning optimizing distribution of naval information war | |
| CN1818956A (en) | Counter-resource linear planning optimizing distribution on agricultural information | |
| CN1818948A (en) | Resource linear planning optimizing distribution of naval force information war | |
| CN104156878B (en) | Determination method for upgrading of rural power grids upgrading engineering evaluation index weights | |
| Zinyemba | Leadership challenges for women managers in the hospitality and financial services in Zimbabwe | |
| Hatami-Marbini et al. | Modeling centralized resources allocation and target setting in imprecise data envelopment analysis | |
| CN116126015B (en) | Dynamic environment multi-unmanned aerial vehicle task allocation method based on improved artificial bee colony algorithm | |
| CN115564374A (en) | Collaborative multitask redistribution method, device, equipment and readable storage medium | |
| CN1818952A (en) | Resource object planning optimizing distribution of combined operation information war | |
| CN1818946A (en) | Resource object planning optimizing distribution of naval force information war | |
| CN114779813A (en) | Multi-unmanned aerial vehicle dynamic task allocation method based on improved contract network algorithm | |
| CN1818947A (en) | Resource fuzzy planning optimizing distribution of naval information war | |
| CN1818943A (en) | Resource fuzzy planning optimizing distribution of air force information war | |
| CN1818944A (en) | Resource object planning optimzing distribution of air force information war | |
| CN1818950A (en) | Resource fuzzy planning optimizing distribution of army information war | |
| CN1845137A (en) | Resource blurry programming optimum distribution method for jointly operated information warfare | |
| JP4662068B2 (en) | Resource distribution method, program, and resource distribution apparatus | |
| CN111861034A (en) | Method and device for optimizing marshalling capability of equipment architecture | |
| Hoffmann-Lange | The salience of the socio-economic cleavage in old and new democracies | |
| Ishizuka | An empirical analysis of women’s promotion in Japanese companies: Comparison with Chinese and Korean cases |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20060816 |