Method and device for determining feasible solution of linear programming problem, equipment and medium

By constructing the symmetrical alternating direction algorithm of the Lagrangian function, the solution process of linear programming problems is simplified, the problem of inefficient calculation efficiency of large-scale problems in the existing technology is solved, and efficient linear programming is achieved.

CN119089077APending Publication Date: 2024-12-06ROCKET FORCE UNIV OF ENG
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410971087.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-19
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

When solving feasible solutions to linear programming problems in the prior art, as the scale of the problem increases, the calculation time increases significantly, especially the second-order optimization algorithm is inefficient in large-scale problems.

Method used

The first and second symmetrical alternating direction algorithms are constructed using Lagrangian functions based on original and dual variables. The goal feasible solution of linear programming problems is solved through simple vector calculation, and the linear constraint optimization is transformed into unconstrained optimization, simplifying the calculation process. .

Benefits of technology

It improves the solution efficiency of large-scale linear programming problems, simplifies the calculation process, reduces the calculation complexity, and enables efficient handling of large-scale linear programming problems.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119089077A_ABST
    Figure CN119089077A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides a method, device and equipment for determining a feasible solution of a linear programming problem. The method comprises the steps that a target linear programming function and constraint conditions of the target linear programming function are acquired; according to the target linear programming function and the constraint condition of the target linear programming function, determining a first Lagrange function based on the original variable; constructing a first symmetric alternating direction algorithm corresponding to the first Lagrange function; and determining a target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm. The process of solving the target feasible solution of the target linear programming function is relatively simple, and the large-scale linear programming problem can be processed.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of computer technology and related technical fields, and in particular to a method, device and apparatus suitable for determining a feasible solution to a linear programming problem. Background Art

[0002] Linear programming has a wide range of applications, including but not limited to military operations, economic analysis, business management, and engineering technology. For example, in production management, linear programming can be used to develop optimal production plans to minimize production costs or maximize profits; in logistics management, linear programming can be used to plan optimal transportation routes to minimize transportation costs or maximize transportation efficiency.

[0003] In the prior art, algorithms such as the dual simplex method, the ellipsoid algorithm, and the interior point method are commonly used algorithms for solving feasible solutions to linear programming problems. However, the commonly used algorithms for solving feasible solutions to linear programming problems in the prior art are second-order optimization algorithms, and when the scale of the linear programming problem increases, the solution will be very time-consuming. Summary of the invention

[0004] The embodiments described herein provide a method, apparatus, and device for determining a feasible solution to a linear programming problem, which solve the problems existing in the prior art.

[0005] In a first aspect, according to the present disclosure, a method for determining a feasible solution to a linear programming problem is provided, comprising:

[0006] Obtaining a target linear programming function and constraints of the target linear programming function;

[0007] Determining a first Lagrangian function based on original variables according to the target linear programming function and the constraints of the target linear programming function;

[0008] Construct the first symmetric alternating direction algorithm corresponding to the first Lagrangian function;

[0009] According to the first symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined.

[0010] In some embodiments of the present disclosure, the first Lagrangian function satisfies:

[0011]

[0012] Among them, x 1 、x 2 is the original variable, y is the first dual variable, s is the second dual variable, y T 、sT is the Lagrange multiplier vector and β is the penalty parameter.

[0013] In some embodiments of the present disclosure, the first symmetric alternating direction algorithm satisfies:

[0014]

[0015] Among them, α is the optimization parameter, 0<α<1.

[0016] In some embodiments of the present disclosure, determining the target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm includes:

[0017] According to the first symmetric alternating direction algorithm, a feasible solution of the primal variable and a feasible solution of the dual variable are obtained;

[0018] According to the feasible solutions of the primal variables and the feasible solutions of the dual variables, a target feasible solution of the primal variables of the target linear programming function is determined.

[0019] In some embodiments of the present disclosure, determining the target feasible solution of the original variable of the target linear programming function according to the feasible solution of the original variable and the feasible solution of the dual variable includes:

[0020] Determining a solution error according to the feasible solution of the primal variable and the feasible solution of the dual variable;

[0021] When the solution error satisfies the preset solution error, the feasible solution of the original variable corresponding to the solution error is the target feasible solution of the original variable of the target linear programming function.

[0022] In some embodiments of the present disclosure, after obtaining the target linear programming function and the constraint conditions of the target linear programming function, the method further includes:

[0023] Determining a second Lagrangian function based on dual variables according to the target linear programming function and the constraints of the target linear programming function;

[0024] Constructing the second symmetric alternating direction algorithm corresponding to the second Lagrangian function;

[0025] According to the second symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined.

[0026] In some embodiments of the present disclosure, determining the second Lagrangian function based on the dual variables according to the target linear programming function and the constraints of the target linear programming function includes:

[0027] Determine the target linear programming dual function and the constraint conditions of the target linear programming dual function according to the target linear programming function and the constraint conditions of the target linear programming function;

[0028] According to the target linear programming dual function and the constraint condition of the target linear programming dual function, a second Lagrangian function based on the dual variable is determined.

[0029] In some embodiments of the present disclosure, the second Lagrangian function satisfies:

[0030]

[0031] The second symmetric alternating direction algorithm satisfies:

[0032]

[0033] In a second aspect, according to the content of the present disclosure, there is provided a device for determining a feasible solution to a linear programming problem, comprising:

[0034] An information acquisition module, used to acquire a target linear programming function and constraints of the target linear programming function;

[0035] A first Lagrangian function determination module, used to determine a first Lagrangian function based on original variables according to the target linear programming function and the constraints of the target linear programming function;

[0036] A first symmetric alternating method algorithm building module, used to build a first symmetric alternating direction algorithm corresponding to a first Lagrangian function;

[0037] A target feasible solution determination module is used to determine the target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm.

[0038] In a third aspect, according to the present disclosure, there is provided a computer device, including:

[0039] one or more processors;

[0040] a storage device for storing one or more programs,

[0041] When the one or more programs are executed by the one or more processors, the one or more processors implement any method as described in the first aspect.

[0042] The method, device and equipment for determining the feasible solution of the linear programming problem provided by the embodiment of the present disclosure first obtain the target linear programming function and the constraint conditions of the target linear programming function; then determine the first Lagrangian function based on the original variables according to the target linear programming function and the constraint conditions of the target linear programming function; and construct the first symmetric alternating direction algorithm corresponding to the first Lagrangian function; finally, determine the target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm. By constructing the first symmetric alternating direction algorithm corresponding to the first Lagrangian function, in the process of solving the target feasible solution of the target linear programming function by the first symmetric alternating direction algorithm, since each iteration step in the first symmetric alternating direction algorithm only involves simple vector calculation, the process of solving the target feasible solution of the target linear programming function is relatively simple, and the embodiment of the present disclosure provides the method to transform the solution of the linear constraint optimization problem into the solution of a series of unconstrained optimization problems, which is easier to calculate than the constraint problem, and because the first symmetric alternating direction algorithm does not involve complex calculations and is only a first-order optimization algorithm, it can handle large-scale linear programming problems.

[0043] The above description is only an overview of the technical solution of the embodiment of the present application. In order to more clearly understand the technical means of the embodiment of the present application, it can be implemented in accordance with the contents of the specification. In order to make the above and other purposes, features and advantages of the embodiment of the present application more obvious and easy to understand, the specific implementation methods of the present application are listed below. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings of the embodiments will be briefly described below. It should be noted that the drawings described below only relate to some embodiments of the present disclosure, but are not intended to limit the present disclosure, wherein:

[0045] Figure 1 It is a flowchart of a method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure;

[0046] Figure 2 is a flowchart of another method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure;

[0047] Figure 3 It is a structural schematic diagram of a device for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure;

[0048] Figure 4 It is a structural diagram of a computer device provided in an embodiment of the present disclosure.

[0049] In the drawings, reference numerals with the same last two digits correspond to the same elements. It should be noted that the elements in the drawings are schematic and not drawn to scale. DETAILED DESCRIPTION

[0050] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution of the embodiments of the present disclosure will be clearly and completely described below in conjunction with the accompanying drawings. Obviously, the described embodiments are part of the embodiments of the present disclosure, rather than all of the embodiments. Based on the described embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without creative work also fall within the scope of protection of the present disclosure.

[0051] Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by a person skilled in the art to which the subject matter of the present disclosure belongs. It will be further understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the specification and the relevant art, and will not be interpreted in an idealized or overly formal form unless otherwise explicitly defined herein. As used herein, a statement that two or more parts are "connected" or "coupled" together shall mean that the parts are joined together directly or through one or more intermediate components.

[0052] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase "embodiments" in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0053] The term "and / or" in this article is only a description of the association relationship of the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists, A and B exist at the same time, and B exists. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0054] Furthermore, in all embodiments of the present disclosure, terms such as “first” and “second” are used only to distinguish one component (or a part of a component) from another component (or another part of a component).

[0055] In the description of the present application, unless otherwise specified, "plurality" means more than two (including two), and similarly, "multiple groups" means more than two groups (including two).

[0056] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the accompanying drawings.

[0057] Based on the problems existing in the prior art, the present disclosure provides a method for determining a feasible solution to a linear programming problem. Figure 1 is a flow chart of a method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure, such as Figure 1 As shown, methods for determining feasible solutions to linear programming problems include:

[0058] S110, obtaining a target linear programming function and constraints of the target linear programming function.

[0059] Specifically, the target linear programming function satisfies The constraints of the target linear programming function are satisfied: Among them, x 1 、x 2 is the original variable matrix.

[0060] S120: Determine a first Lagrangian function based on original variables according to the target linear programming function and constraints of the target linear programming function.

[0061] Specifically, the linear programming function of the original linear programming problem satisfies:

[0062] min x c T x

[0063] stAx=b

[0064] x≥0

[0065] Among them, min x c T x is a linear programming function, are the constraints of the linear programming function.

[0066] The Lagrangian function of the linear programming function of the original linear programming problem satisfies:

[0067]

[0068] After the target linear programming function and the constraints of the target linear programming function are obtained in step S110, the first Lagrangian function of the target linear programming function in the present application can be determined based on the Lagrangian function of the original linear programming problem.

[0069] Specifically, the first Lagrangian function based on the original variables in the target linear programming function in this application satisfies:

[0070]

[0071] Among them, x 1 、x 2is the original variable, y is the first dual variable, s is the second dual variable, y T 、s T is the Lagrange multiplier vector and β is the penalty parameter.

[0072] Since an additional constraint condition is newly added to the objective linear function in the present application, the first Lagrangian function corresponding to the objective linear function of the present application adds a dual variable s compared with the Lagrangian function of the linear programming function of the original linear programming problem, that is, the first Lagrangian function includes the first original variable x 1 , the second original variable x 2 , the first dual variable y and the second dual variable s.

[0073] S130, constructing a first symmetric alternating direction algorithm corresponding to the first Lagrangian function.

[0074] After the first Lagrangian function is determined in step S120, a first symmetric alternating direction algorithm corresponding to the first Lagrangian function is constructed, and based on the first symmetric alternating algorithm, a target feasible solution of the target linear programming function is determined.

[0075] Specifically, the first symmetric alternating direction algorithm corresponding to the constructed first Lagrangian function satisfies:

[0076]

[0077] S140. Determine a target feasible solution of the target linear programming function according to a first symmetric alternating direction algorithm.

[0078] After constructing the first symmetric alternating direction algorithm corresponding to the first Lagrangian function in step S130, the target feasible solution of the target linear programming function is solved by the first symmetric alternating direction algorithm.

[0079] Specifically, according to the first symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined, including: according to the first symmetric alternating direction algorithm, a feasible solution of the original variables and a feasible solution of the dual variables are obtained; according to the feasible solution of the original variables and the feasible solution of the dual variables, a target feasible solution of the original variables of the target linear programming function is determined.

[0080] Among them, according to the feasible solution of the original variables and the feasible solution of the dual variables, the target feasible solution of the original variables of the target linear programming function is determined, including: according to the feasible solution of the original variables and the feasible solution of the dual variables, the solution error is determined; when the solution error satisfies the preset solution error, the feasible solution of the original variables corresponding to the solution error is the target feasible solution of the original variables of the target linear programming function.

[0081] In a specific embodiment, in combination with the steps of the first symmetric alternating direction algorithm, when the initial value of the second original variable under the given loop condition is Initial value y of the first dual variable 0 and the initial value s of the second dual variable 0 After that, the first step of the first symmetric alternating direction algorithm is executed to solve the derivative of the first Lagrangian function with respect to the first primitive variable and to replace the initial value of the second primitive variable with Initial value y of the first dual variable 0 and the second dual variable s 0 After the initial value of is brought into the derivative function of the first Lagrangian function with respect to the first original variable, the derivative function of the first Lagrangian function with respect to the first original variable is set equal to zero, and the first feasible solution of the first original variable in the first cycle step is obtained. Then the first feasible solution of the first primal variable is brought into the second and third steps of the first symmetric alternating direction algorithm to obtain the intermediate value of the first dual variable in the first cycle step. and the intermediate value of the second dual variable Then, the fourth step of the first symmetric alternating direction algorithm is performed to solve the derivative of the first Lagrangian function with respect to the second primitive variable and convert the first feasible solution of the first primitive variable into Intermediate value of the first dual variable and the intermediate value of the second dual variable After substituting the obtained derivative function of the first Lagrangian function with respect to the second original variable, the derivative function of the first Lagrangian function with respect to the second original variable is set equal to zero, and the first feasible solution of the second original variable in the first cycle step is obtained. Then the first feasible solution of the first primal variable is brought into the fifth step of the first symmetric alternating direction algorithm to obtain the first feasible solution y of the first dual variable in the first cycle step. 1 , bring the first feasible solution of the first primal variable and the first feasible solution of the second primal variable into the sixth step of the first symmetric alternating direction algorithm, and obtain the first feasible solution s of the second dual variable in the first cycle step 1 .

[0082] When executing the first cycle of the first symmetric alternating direction algorithm, the first feasible solution for the first primitive variable is obtained. First feasible solution for the second primal variable The first feasible solution y of the first dual variable 1 and the first feasible solution s of the second dual variable 1 Then, by substituting the first feasible solution of the first primal variable and the first feasible solution of the first dual variable into the formula The solution error is obtained, and then the relationship between the solution error and the preset solution error is judged. When the absolute value of the solution error is less than the preset solution error, the first feasible solution of the first original variable is That is, the target feasible solution of the target linear programming function. When the absolute value of the solution error is greater than or equal to the preset solution error, the first symmetric alternating direction algorithm is executed again, and the second cycle is performed to obtain the second feasible solution of the first original variable. The second feasible solution for the second primal variable The second feasible solution y of the first dual variable 2 and the second feasible solution s of the second dual variable 2 , and then by substituting the second feasible solution of the first primal variable and the second feasible solution of the first dual variable into the formula The solution error is obtained, and then the second feasible solution of the first original variable is determined by judging the relationship between the solution error and the preset solution error. Whether it is a target feasible solution of the target linear programming function, and so on, until the target feasible solution of the target linear programming function is found, the cycle of the first symmetric alternating direction algorithm is stopped.

[0083] In the above embodiment, the first step of the first symmetric alternating direction algorithm is executed to solve the derivative of the first Lagrangian function with respect to the first primitive variable and to convert the initial value of the second primitive variable into Initial value y of the first dual variable 0 and the second dual variable s 0 After the initial value of is brought into the derivative function of the first Lagrangian function with respect to the first original variable, the derivative function of the first Lagrangian function with respect to the first original variable is set equal to zero, and the first feasible solution of the first original variable in the first cycle step is obtained. In the process, the derivative of the first Lagrangian function with respect to the first original variable satisfies:

[0084]

[0085] Combined with the first Lagrangian function, we get:

[0086]

[0087] At this point, the first feasible solution for the first original variable satisfies:

[0088]

[0089] In addition, in the above embodiment, the fourth step of the first symmetric alternating direction algorithm is executed to solve the derivative of the first Lagrangian function with respect to the second primitive variable, and the first feasible solution of the first primitive variable is converted to Intermediate value of the first dual variable and the intermediate value of the second dual variable After substituting the obtained derivative function of the first Lagrangian function with respect to the second original variable, the derivative function of the first Lagrangian function with respect to the second original variable is set equal to zero, and the first feasible solution of the second original variable in the first cycle step is obtained. In the process, the derivative of the first Lagrangian function with respect to the second original variable satisfies:

[0090]

[0091] At this time, the first feasible solution of the second primal variable satisfies:

[0092]

[0093] Since there is a constraint on the second original variable x 2 ≥0, therefore, in the process of solving the second original variable based on the first symmetric alternating direction algorithm, when the feasible solution of the second original variable is greater than zero, the feasible solution of the second original variable is the feasible solution of the second original variable; when the feasible solution of the second original variable is less than or equal to zero, the feasible solution of the second original variable is zero.

[0094] The method for determining a feasible solution to a linear programming problem provided by the embodiment of the present disclosure first obtains the target linear programming function and the constraints of the target linear programming function; then, according to the target linear programming function and the constraints of the target linear programming function, determines the first Lagrangian function based on the original variables; and constructs the first symmetric alternating direction algorithm corresponding to the first Lagrangian function; finally, according to the first symmetric alternating direction algorithm, determines the target feasible solution of the target linear programming function. By constructing the first symmetric alternating direction algorithm corresponding to the first Lagrangian function, in the process of solving the target feasible solution of the target linear programming function by the first symmetric alternating direction algorithm, since each iteration step in the first symmetric alternating direction algorithm only involves simple vector calculations, the process of solving the target feasible solution of the target linear programming function is relatively simple, and the embodiment of the present disclosure provides the method to transform the solution of the linear constraint optimization problem into the solution of a series of unconstrained optimization problems, which is easier to calculate than the constraint problem, and because the first symmetric alternating direction algorithm does not involve complex calculations and is only a first-order optimization algorithm, it can handle large-scale linear programming problems.

[0095] Based on the above embodiments, Figure 2 is a flow chart of another method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure, such as Figure 2 As shown, methods for determining feasible solutions to linear programming problems include:

[0096] S121. Determine a second Lagrangian function based on dual variables according to the target linear programming function and the constraints of the target linear programming function.

[0097] According to the duality theorem of linear programming, solving the target feasible solution of the target linear programming function is equivalent to solving the target feasible solution of the target linear programming dual function of the target linear programming function. Therefore, in another method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure, first, according to the target linear programming function and the constraints of the target linear programming function, a second Lagrangian function based on the dual variable is determined.

[0098] In a specific implementation, according to the target linear programming function and the constraints of the target linear programming function, determining the second Lagrangian function based on the dual variables includes: according to the target linear programming function and the constraints of the target linear programming function, determining the target linear programming dual function and the constraints of the target linear programming dual function; according to the target linear programming dual function and the constraints of the target linear programming dual function, determining the second Lagrangian function based on the dual variables.

[0099] Specifically, the dual function of the target linear programming satisfies min y b T y, the constraints of the dual function of the target linear programming satisfy:

[0100] According to the dual function of the target linear programming and the constraints of the dual function of the target linear programming, it is determined that the second Lagrangian function based on the dual variable satisfies:

[0101]

[0102] S131. Construct a second symmetric alternating direction algorithm corresponding to the second Lagrangian function.

[0103] After the second Lagrangian function is determined in step S121, a second symmetric alternating direction algorithm corresponding to the second Lagrangian function is constructed, and based on the second symmetric alternating algorithm, a target feasible solution of the target linear programming function is determined.

[0104] Specifically, the second symmetric alternating direction algorithm corresponding to the constructed second Lagrangian function satisfies:

[0105]

[0106] S141. Determine a target feasible solution of the target linear programming function according to a second symmetric alternating direction algorithm.

[0107] After constructing the second symmetric alternating direction algorithm corresponding to the second Lagrangian function in step S131, the target feasible solution of the target linear programming function is solved by the second symmetric alternating direction algorithm.

[0108] Specifically, according to the second symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined, including: according to the second symmetric alternating direction algorithm, a feasible solution of the original variables and a feasible solution of the dual variables are obtained; according to the feasible solution of the original variables and the feasible solution of the dual variables, a target feasible solution of the original variables of the target linear programming function is determined.

[0109] Among them, according to the feasible solution of the original variables and the feasible solution of the dual variables, the target feasible solution of the original variables of the target linear programming function is determined, including: according to the feasible solution of the original variables and the feasible solution of the dual variables, the solution error is determined; when the solution error satisfies the preset solution error, the feasible solution of the original variables corresponding to the solution error is the target feasible solution of the original variables of the target linear programming function.

[0110] In a specific implementation, in combination with the steps of the second symmetric alternating direction algorithm, when the initial value x of the original variable under the given loop condition is 0 and the initial value s of the second dual variable 0 After that, the first step of the second symmetric alternating direction algorithm is executed to solve the derivative of the second Lagrangian function with respect to the first dual variable and the initial value x of the original variable 0 and the second dual variable s 0 After the initial value of is substituted into the derivative function of the second Lagrangian function with respect to the first dual variable, the derivative function of the second Lagrangian function with respect to the first dual variable is set equal to zero, and the first feasible solution y of the first dual variable in the first cycle step is obtained. 1 , then the first feasible solution of the first dual variable is brought into the second step of the second symmetric alternating direction algorithm to obtain the intermediate value of the original variable in the first cycle step Then, the third step of the second symmetric alternating direction algorithm is performed to solve the derivative of the second Lagrangian function with respect to the second dual variable and convert the first feasible solution y to the first dual variable. 1 , the intermediate value of the original variable After substituting the obtained derivative function of the second Lagrangian function with respect to the second dual variable into the derivative function, the derivative function of the second Lagrangian function with respect to the second dual variable is set equal to zero, and the first feasible solution s of the second dual variable in the first cycle step is obtained. 1 , then the first feasible solution of the first dual variable, the first feasible solution of the second dual variable and the intermediate value of the original variable are brought into the fourth step of the second symmetric alternating direction algorithm to obtain the first feasible solution x of the original variable in the first cycle step 1 .

[0111] When executing the first cycle of the second symmetric alternating direction algorithm, the first feasible solution x of the original variable is obtained. 1 , the first feasible solution y of the first dual variable 1 and the first feasible solution s of the second dual variable 1 Then, by substituting the first feasible solution of the primal variable and the first feasible solution of the first dual variable into the formula The solution error is obtained, and then the relationship between the solution error and the preset solution error is judged. When the absolute value of the solution error is less than the preset solution error, the first feasible solution x of the original variable is 1 That is, the target feasible solution of the target linear programming function. When the absolute value of the solution error is greater than or equal to the preset solution error, the second symmetric alternating direction algorithm is executed again, and the second cycle is performed to obtain the second feasible solution x of the original variable. 2 , the second feasible solution y of the first dual variable 2 and the second feasible solution s of the second dual variable 2 , and then by substituting the second feasible solution of the primal variable and the second feasible solution of the first dual variable into the formula The solution error is obtained, and then the second feasible solution x of the original variable is determined by judging the relationship between the solution error and the preset solution error. 2 Whether it is a target feasible solution of the target linear programming function, and so on, until the target feasible solution of the target linear programming function is found, the cycle of the second symmetric alternating direction algorithm is stopped.

[0112] In the above embodiment, the first step of the second symmetric alternating direction algorithm is executed to solve the derivative of the second Lagrangian function with respect to the first dual variable and to convert the initial value x of the original variable into 0 , the second dual variable s 0 After the initial value of is substituted into the derivative function of the second Lagrangian function with respect to the first dual variable, the derivative function of the second Lagrangian function with respect to the first dual variable is set equal to zero, and the first feasible solution y of the first dual variable in the first cycle step is obtained. 1 In the process, the derivative of the second Lagrangian function with respect to the first dual variable satisfies:

[0113]

[0114] Combined with the second Lagrangian function, we get:

[0115] -b-Ax k +βA(A T y k+1 +s k -c)=0

[0116] At this time, the first feasible solution of the first dual variable satisfies:

[0117]

[0118] In addition, in the above embodiment, the third step of the second symmetric alternating direction algorithm is executed to solve the derivative of the second Lagrangian function with respect to the second dual variable, and the intermediate value of the original variable is converted to and the first feasible solution intermediate value y of the first dual variable 1 After substituting the obtained derivative function of the second Lagrangian function with respect to the second dual variable into the derivative function, the derivative function of the second Lagrangian function with respect to the second dual variable is set equal to zero, and the first feasible solution s of the second dual variable in the first cycle step is obtained. 1 In the process, the derivative of the second Lagrangian function with respect to the second dual variable satisfies:

[0119]

[0120] At this time, the first feasible solution of the second dual variable satisfies:

[0121]

[0122] Since the second dual variable is subject to the constraint s≥0, in the process of solving the second dual variable based on the second symmetric alternating direction algorithm, when the feasible solution of the second dual variable is greater than zero, the feasible solution of the second dual variable is the feasible solution of the second dual variable; when the feasible solution of the second dual variable is less than or equal to zero, the feasible solution of the second dual variable is zero.

[0123] In the method for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure, a second Lagrangian function based on dual variables is determined according to a target linear programming function and constraints of the target linear programming function; a second symmetric alternating direction algorithm corresponding to the second Lagrangian function is constructed; and a target feasible solution of the target linear programming function is determined according to the second symmetric alternating direction algorithm.

[0124] Based on the above embodiments, the present disclosure also provides a device for determining a feasible solution to a linear programming problem. Figure 3 is a schematic diagram of the structure of an apparatus for determining a feasible solution to a linear programming problem provided by an embodiment of the present disclosure, such as Figure 3 As shown, the device for determining a feasible solution to a linear programming problem comprises:

[0125] An information acquisition module 310 is used to acquire a target linear programming function and constraints of the target linear programming function;

[0126] A first Lagrangian function determination module 320, configured to determine a first Lagrangian function based on original variables according to a target linear programming function and constraints of the target linear programming function;

[0127] A first symmetric alternating method algorithm construction module 330 is used to construct a first symmetric alternating direction algorithm corresponding to the first Lagrangian function;

[0128] The target feasible solution determination module 340 is used to determine the target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm.

[0129] The device for determining the feasible solution of a linear programming problem provided by the embodiment of the present disclosure first obtains the target linear programming function and the constraints of the target linear programming function; then, according to the target linear programming function and the constraints of the target linear programming function, determines the first Lagrangian function based on the original variables; and constructs the first symmetric alternating direction algorithm corresponding to the first Lagrangian function; finally, according to the first symmetric alternating direction algorithm, determines the target feasible solution of the target linear programming function. By constructing the first symmetric alternating direction algorithm corresponding to the first Lagrangian function, in the process of solving the target feasible solution of the target linear programming function by the first symmetric alternating direction algorithm, since each iterative step in the first symmetric alternating direction algorithm only involves simple vector calculations, the process of solving the target feasible solution of the target linear programming function is relatively simple, and the embodiment of the present disclosure provides a method that converts solving a linear constrained optimization problem into solving a series of unconstrained optimization problems, which is easier to calculate than a constrained problem, and because the first symmetric alternating direction algorithm does not involve complex calculations and is only a first-order optimization algorithm, it can handle large-scale linear programming problems. In a specific implementation, the first Lagrangian function satisfies:

[0130]

[0131] Among them, x 1 、x 2 is the original variable, y is the first dual variable, s is the second dual variable, y T 、s T is the Lagrange multiplier vector and β is the penalty parameter.

[0132] In a specific implementation, the first symmetric alternating direction algorithm satisfies:

[0133]

[0134] Among them, α is the optimization parameter, 0<α<1.

[0135] In a specific implementation, according to the first symmetric alternating direction algorithm, determining a target feasible solution of the target linear programming function includes:

[0136] According to the first symmetric alternating direction algorithm, the feasible solution of the primal variables and the feasible solution of the dual variables are obtained;

[0137] Based on the feasible solutions of the primal variables and the feasible solutions of the dual variables, the target feasible solutions of the primal variables of the target linear programming function are determined.

[0138] In a specific implementation, determining a target feasible solution of the original variable of the target linear programming function according to the feasible solution of the original variable and the feasible solution of the dual variable includes:

[0139] Determine the solution error based on the feasible solution of the primal variable and the feasible solution of the dual variable;

[0140] When the solution error satisfies the preset solution error, the feasible solution of the original variable corresponding to the solution error is the target feasible solution of the original variable of the target linear programming function.

[0141] In a specific implementation, after obtaining the target linear programming function and the constraints of the target linear programming function, it also includes:

[0142] Determine a second Lagrangian function based on dual variables according to the target linear programming function and the constraints of the target linear programming function;

[0143] Constructing the second symmetric alternating direction algorithm corresponding to the second Lagrangian function;

[0144] According to the second symmetric alternating direction algorithm, the target feasible solution of the target linear programming function is determined.

[0145] In a specific implementation, according to the target linear programming function and the constraints of the target linear programming function, determining the second Lagrangian function based on the dual variables includes:

[0146] According to the target linear programming function and the constraint conditions of the target linear programming function, determine the constraint conditions of the target linear programming dual function and the target linear programming dual function;

[0147] According to the objective linear programming dual function and the constraint conditions of the objective linear programming dual function, a second Lagrangian function based on the dual variables is determined.

[0148] In a specific implementation, the second Lagrangian function satisfies:

[0149]

[0150] The second symmetric alternating direction algorithm satisfies:

[0151]

[0152] The present application also provides a computer device. Figure 4 , Figure 4 This is a basic structural block diagram of the computer device in this embodiment.

[0153] The computer device includes a memory 510 and a processor 520 that are connected to each other through a system bus. It should be noted that the figure only shows a computer device with components 510-520, but it should be understood that it is not required to implement all the components shown, and more or fewer components can be implemented instead. Among them, those skilled in the art can understand that the computer device here is a device that can automatically perform numerical calculations and / or information processing according to pre-set or stored instructions, and its hardware includes but is not limited to microprocessors, application specific integrated circuits (Application Specific Integrated Circuit, ASIC), programmable gate arrays (Field-Programmable Gate Array, FPGA), digital processors (Digital Signal Processor, DSP), embedded devices, etc.

[0154] Computer devices can be computing devices such as desktop computers, notebooks, PDAs, and cloud servers. Computer devices can interact with users through keyboards, mice, remote controls, touch pads, or voice control devices.

[0155] The memory 510 includes at least one type of readable storage medium, and the readable storage medium includes a non-volatile memory or a volatile memory, such as a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, etc., and the RAM may include a static RAM or a dynamic RAM. In some embodiments, the memory 510 may be an internal storage unit of a computer device, such as a hard disk or a memory of the computer device. In other embodiments, the memory 510 may also be an external storage device of a computer device, such as a plug-in hard disk, a smart memory card (SMC), a secure digital (SD) card, or a flash card (Flash Card), etc., equipped on the computer device. Of course, the memory 510 may also include both an internal storage unit of the computer device and an external storage device thereof. In this embodiment, the memory 510 is generally used to store an operating system and various application software installed on the computer device, such as the program code of the above method, etc. In addition, the memory 510 may also be used to temporarily store various data that have been output or are to be output.

[0156] The processor 520 is generally used to perform the overall operation of the computer device. In this embodiment, the memory 510 is used to store program codes or instructions, the program code includes computer operation instructions, and the processor 520 is used to execute the program codes or instructions stored in the memory 510 or process data, such as running the program code of the above method.

[0157] In this article, the bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Architecture (EISA) bus, etc. The bus system can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0158] Another embodiment of the present application also provides a computer-readable medium, which may be a computer-readable signal medium or a computer-readable medium. A processor in a computer reads a computer-readable program code stored in the computer-readable medium, so that the processor can execute the functional actions specified in each step or a combination of steps in the above method; and generate a device for implementing the functional actions specified in each block or a combination of blocks in the block diagram.

[0159] Computer-readable media include but are not limited to electronic, magnetic, optical, electromagnetic, infrared memory or semiconductor systems, devices or apparatuses, or any appropriate combination of the foregoing, the memory is used to store program codes or instructions, the program codes include computer operating instructions, and the processor is used to execute the program codes or instructions of the above methods stored in the memory.

[0160] For the definitions of memory and processor, please refer to the description of the aforementioned computer device embodiment and will not be repeated here.

[0161] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of modules or units is only a logical function division, and there may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0162] Each functional unit or module in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0163] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium, including a number of instructions to enable a computer device (which can be a personal computer, server, or network device, etc.) or a processor (processor) to perform all or part of the steps of each embodiment method of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), disk or optical disk and other media that can store program code.

[0164] Unless the context clearly indicates otherwise, the singular form of the words used herein and in the appended claims includes the plural and vice versa. Thus, when referring to the singular, the plural form of the corresponding term is generally included. Similarly, the words "comprise" and "include" are to be interpreted as inclusive rather than exclusive. Likewise, the terms "include" and "or" should be interpreted as inclusive unless such interpretation is expressly prohibited herein. Where the term "example" is used herein, particularly when it is located after a group of terms, the "example" is merely exemplary and illustrative and should not be considered exclusive or comprehensive.

[0165] Further aspects and scopes of adaptability become apparent from the description provided herein. It should be understood that various aspects of the present application can be implemented individually or in combination with one or more other aspects. It should also be understood that the description and specific embodiments herein are intended for purposes of illustration only and are not intended to limit the scope of the present application.

[0166] Several embodiments of the present disclosure are described in detail above, but it is obvious that those skilled in the art can make various modifications and variations to the embodiments of the present disclosure without departing from the spirit and scope of the present disclosure. The protection scope of the present disclosure is defined by the attached claims.

Claims

1. A method for determining feasible solutions to linear programming problems, It is characterized in that include: Obtaining a target linear programming function and constraints of the target linear programming function; Determining a first Lagrangian function based on original variables according to the target linear programming function and the constraints of the target linear programming function; Construct the first symmetric alternating direction algorithm corresponding to the first Lagrangian function; According to the first symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined.

2. The method according to claim 1, It is characterized in that The first Lagrangian function satisfies: Among them, x 1 、x 2 is the original variable, y is the first dual variable, s is the second dual variable, y T 、s T is the Lagrange multiplier vector and β is the penalty parameter.

3. The method according to claim 1, It is characterized in that The first symmetric alternating direction algorithm satisfies: Among them, α is the optimization parameter, 0<α<1.

4. The method according to claim 1, It is characterized in that Determining the target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm includes: According to the first symmetric alternating direction algorithm, a feasible solution of the primal variable and a feasible solution of the dual variable are obtained; According to the feasible solutions of the primal variables and the feasible solutions of the dual variables, a target feasible solution of the primal variables of the target linear programming function is determined.

5. The method according to claim 4, It is characterized in that Determining the target feasible solution of the original variable of the target linear programming function according to the feasible solution of the original variable and the feasible solution of the dual variable includes: Determining a solution error according to the feasible solution of the primal variable and the feasible solution of the dual variable; When the solution error satisfies the preset solution error, the feasible solution of the original variable corresponding to the solution error is the target feasible solution of the original variable of the target linear programming function.

6. The method according to claim 1, It is characterized in that After obtaining the target linear programming function and the constraint conditions of the target linear programming function, the method further includes: Determining a second Lagrangian function based on dual variables according to the target linear programming function and the constraints of the target linear programming function; Constructing the second symmetric alternating direction algorithm corresponding to the second Lagrangian function; According to the second symmetric alternating direction algorithm, a target feasible solution of the target linear programming function is determined.

7. The method according to claim 6, It is characterized in that Determining a second Lagrangian function based on dual variables according to the target linear programming function and the constraints of the target linear programming function includes: Determine the target linear programming dual function and the constraint conditions of the target linear programming dual function according to the target linear programming function and the constraint conditions of the target linear programming function; According to the target linear programming dual function and the constraint condition of the target linear programming dual function, a second Lagrangian function based on the dual variable is determined.

8. The method according to claim 6, It is characterized in that The second Lagrangian function satisfies: The second symmetric alternating direction algorithm satisfies:

9. A device for determining feasible solutions to linear programming problems, It is characterized in that include: An information acquisition module, used to acquire a target linear programming function and constraints of the target linear programming function; A first Lagrangian function determination module, used to determine a first Lagrangian function based on original variables according to the target linear programming function and the constraints of the target linear programming function; A first symmetric alternating method algorithm building module, used to build a first symmetric alternating direction algorithm corresponding to a first Lagrangian function; A target feasible solution determination module is used to determine a target feasible solution of the target linear programming function according to the first symmetric alternating direction algorithm.

10. A computer device, It is characterized in that include: one or more processors; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1 to 8.