Information processing method, information processing system, and program
By generating a second linear programming problem with relaxed constraints, the method identifies and corrects inconsistent constraints in large-scale linear programming problems, ensuring solvability.
Patent Information
- Application Number
- JP2024112771
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Filing Date
- 2024-07-12
- Publication Date
- 2024-11-14
- Estimated Expiration
- 2044-07-12
AI Technical Summary
Linear programming problems with thousands of variables and tens of thousands of constraints are often infeasible due to intertwined constraints, making it difficult to identify the cause of infeasibility.
Generate a second linear programming problem by relaxing constraints of a first linear programming problem, solve this new problem to identify which constraints cannot be satisfied, and output information for correction.
Identifies and allows correction of inconsistent constraints in linear programming problems, ensuring feasibility and solvability.
Smart Images

Figure 0007583973000008 
Figure 0007583973000009 
Figure 0007583973000010
Abstract
Description
[Technical field]
[0001] The present invention relates to an information processing method, an information processing system, and a program. [Background technology]
[0002] Patent Document 1 discloses a voltage and reactive power control device that reduces the increase in the number of operations and the influence of linearization errors when generating an operation signal for a VQ regulator by solving a linear programming problem. [Prior art documents] [Patent documents]
[0003] [Patent Document 1] Patent No. 3372460 Summary of the Invention [Problem to be solved by the invention]
[0004] There is a known method for formulating an optimization problem as a linear programming problem. An optimization problem is a problem of finding a specific value that minimizes the value of an objective function among those that satisfy given constraints. In particular, a linear programming problem is one in which the constraints and the objective function are written as linear expressions. Some linear programming problems are infeasible because the constraints are contradictory. Some such linear programming problems are infeasible because three or more constraints interact with each other.
[0005] In practical situations, the objective function of a linear programming problem can have thousands of variables and tens of thousands of constraints, making it difficult to identify the cause of infeasibility. [Means for solving the problem]
[0006] According to one aspect of the present invention, there is provided an information processing method executed by an information processing system. This information processing method generates a second linear programming problem different from a first linear programming problem, based on the first linear programming problem for which constraint violations are to be detected. The first linear programming problem includes n first constraint conditions and a first objective function. The second linear programming problem includes n second constraint conditions and a second objective function. The second constraint conditions are obtained by relaxing the first constraint conditions by ui. The second objective function is
number
[0007] [Figure 1] FIG. 1 is a diagram illustrating an example of a system configuration of an information processing system. [Diagram 2] FIG. 2 is a diagram illustrating an example of a hardware configuration of the server device. [Diagram 3] FIG. 3 is a diagram illustrating an example of a hardware configuration of the client device. [Figure 4] FIG. 4 is a flowchart (part 1) illustrating an example of information processing in the server device. [Diagram 5] FIG. 5 is a diagram showing an example of the first linear programming problem displayed on the output unit of the client device. [Figure 6] FIG. 6 is a diagram illustrating an example of the second linear programming problem. [Figure 7] FIG. 7 is a diagram showing an example of a screen displayed on the output unit of the client device. [Figure 8] FIG. 8 is a flowchart (part 2) illustrating an example of information processing in the server device. [Figure 9] FIG. 9 is a diagram illustrating an example of the third linear programming problem. [Figure 10] FIG. 10 is a diagram showing an example of a screen displayed on the output unit of the client device. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0008] Hereinafter, an embodiment of the present invention will be described with reference to the drawings. Various characteristic features shown in the following embodiment (including modified examples, which also apply hereinafter) can be combined with each other.
[0009] <Embodiment 1> 1. System configuration diagram FIG. 1 is a diagram showing an example of a system configuration of an information processing system 1000. As shown in FIG. 1, the information processing system 1000 includes, as a system configuration, a server device 100 and a client device 110. The server device 100 is an example of a computer. The server device 100 and the client device 110 are communicatively connected via a network 150. The network 150 may include either or both of a WAN (Wide Area Network) and the Internet. The network 150 is configured to enable communication between devices connected to the network 150 via wired and wireless connections.
[0010] The server device 100 executes information processing and the like described in the first embodiment in response to requests and the like from the client device 110. Details of the processing by the server device 100 will be described using flowcharts and the like described later. The server device included in the information processing system 1000 may be one or more. When the information processing system 1000 includes more than one server device, the functions of the server device 100 are provided as a so-called distributed system.
[0011] The client device 110 is a device operated by an operator of the information processing system 1000, and is a device that uses functions provided by the server device 100. In Fig. 1, a PC (Personal Computer) is shown as an example of the client device 110, but the client device 110 is not limited to a PC and may be a tablet terminal device or a smartphone. The client device 110 may be any device that can input operation information, etc. from the operator and display the results of processing in the server device 100, etc.
[0012] Here, the information processing system described in the claims may be composed of multiple devices or may be composed of one device. When the information processing system described in the claims is composed of one device, an example of the device is, for example, a server device 100. When the information processing system described in the claims is composed of multiple devices, an example of the multiple devices is, for example, a distributed system that provides the functions of the server device 100, or the server device 100 and the client device 110.
[0013] 2. Hardware Configuration (1) Hardware Configuration of Server Device 100 FIG. 2 is a diagram illustrating an example of a hardware configuration of the server device 100. As shown in FIG. 2, the server device 100 includes, as its hardware configuration, a control unit 210, a storage unit 220, a communication unit 230, and an internal bus 240. The control unit 210, the storage unit 220, and the communication unit 230 are electrically connected via the internal bus 240.
[0014] The control unit 210 is a CPU (Central Processing Unit) or the like, and controls the entire server device 100 .
[0015] The storage unit 220 is any one of a hard disk drive (HDD), a read only memory (ROM), a random access memory (RAM), a solid state drive (SSD), etc., or any combination thereof, and stores a program and data (for example, a compiler, a linker, a loader, a library, a linear programming problem, etc., which will be described later) used when the control unit 210 executes processing based on the program. In the following description, the server device 100 will be described as having a ROM, a RAM, a HDD, and an SSD as storage units. The storage unit 220 is an example of a storage medium. In the specification, the data used when the control unit 210 executes processing based on the program will be described as being stored in the storage unit 220, but the data may be stored in a storage unit of another device that can communicate with the server device 100. In other words, the data may be stored in a storage unit of any device as long as the control unit 210 can refer to or obtain the data. The control unit 210 executes processing based on a program stored in the storage unit 220, thereby realizing the functions of the server device 100 and the processing of the flowcharts shown in Figs. 4 and 8, etc., which will be described later.
[0016] When the programming language of the source code is a compilation language, the control unit 210 converts the source code stored in a ROM, HDD, SSD, or the like into an object code using a compiler. The control unit 210 generates a load module by linking the object code and a library using a linker. The control unit 210 loads the load module into a memory such as a RAM using a loader. The control unit 210 executes the load module loaded into the memory to realize the processing of the flowcharts shown in Figs. 4 and 7, which will be described later. When the programming language of the source code is an interpreter type, the control unit 210 reads the source code stored in a ROM, HDD, SSD, etc. into a memory such as a RAM, and executes processing while performing lexical analysis and / or syntactic analysis on the read source code line by line during execution, thereby realizing the processing of the flowcharts shown in Figures 4 and 7, etc., which will be described later.
[0017] The communication unit 230 connects the server device 100 to the network 150 and controls communications with other devices.
[0018] (2) Hardware Configuration of the Client Device 110 FIG. 3 is a diagram illustrating an example of a hardware configuration of the client device 110. As shown in FIG. As shown in FIG. 3, the client device 110 includes, as its hardware configuration, a control unit 310, a storage unit 320, an input unit 330, an output unit 340, a communication unit 350, and an internal bus 360.
[0019] The control unit 310 is a CPU or the like, and controls the entire client device 110 .
[0020] The storage unit 320 is any one of an HDD, a ROM, a RAM, an SSD, etc., or any combination of these, and stores programs and data used when the control unit 310 executes processing based on the programs. The storage unit 320 is an example of a storage medium.
[0021] The input unit 330 is a keyboard, a mouse, or the like, and inputs information based on a selection operation and / or an input operation by an operator. The output unit 340 is a display or the like, and displays information input by an operator via a screen, results of processing by the control unit 310, and the like.
[0022] The communication unit 350 connects the client device 110 to the network 150 and manages communications with other devices.
[0023] 3. Information Processing (1) Overview of the process The control unit 210 generates a second linear programming problem different from the first linear programming problem based on the first linear programming problem for which a constraint violation is to be detected. The first linear programming problem includes n first constraint conditions and a first objective function. The second linear programming problem includes n second constraint conditions and a second objective function. The second constraint conditions are the first constraint conditions relaxed by ui. In other words, the second constraint conditions are the first constraint conditions plus a relaxation term ui. The second objective function is
number
[0024] (2) Details of the processing FIG. 4 is a flowchart (part 1) showing an example of information processing in the server device 100. In step S401, the control unit 210 acquires a first linear programming problem for which a constraint violation is to be detected. For example, the control unit 210 acquires the first linear programming problem specified via a screen of the client device 110 from the storage unit 220 or the like. The control unit 210 controls the output unit 340 of the client device 110 to display a screen including the acquired first linear programming problem.
[0025] Fig. 5 is a diagram showing an example of a first linear programming problem 500 displayed on the output unit 340 of the client device 110. As described above, in practical situations, the number of variables in the objective function of a linear programming problem may be several thousand, and the number of constraint conditions may be several tens of thousands. However, for the sake of simplicity, the present specification will use the linear programming problem shown in Fig. 5 as an example. x+y is the objective function (first objective function) 510 of the first linear programming problem 500 . x ≥ 1 3x+2y≧6 -3x-2y≧6 are constraints (first constraints) 520 of the first linear programming problem 500.
[0026] In step S402 in FIG. In step S403, the control unit 210 generates a second linear programming problem different from the first linear programming problem 500, based on the first linear programming problem 500. The second linear programming problem includes n constraint conditions (also referred to as second constraint conditions) and an objective function (also referred to as second objective function).
[0027] FIG. 6 illustrates an example of a second linear programming problem 600 . 6, a second constraint 620 of a second linear programming problem 600 is a constraint obtained by relaxing the first constraint by ui. To explain the constraint obtained by relaxing the first constraint by ui more specifically, x≧1-u1 3x+2y≧6-u2 -3x-2y≧6-u3 (where ui>0). The second objective function 610 is:
number
[0028] 4, the control unit 210 calculates a solution by solving the second linear programming problem 600. The constraint condition for which ui≠0.0 is the constraint condition that cannot be satisfied. Solving the second linear programming problem 600 gives: u1=0.0, u2=0.0, and u3=12.0.
[0029] In step S405, the control unit 210 outputs information about the constraint condition. More specifically, the control unit 210 solves the second linear programming problem 600 and outputs information about the constraint condition (u3 in the above example) that could not be satisfied. For example, the information about u3 may be information including at least u3, information including the first constraint condition corresponding to u3, i.e., -3x-2y≧6, or information including u3 and -3x-2y≧6.
[0030] Furthermore, the control unit 210 may output information by controlling a screen including information on the constraint conditions that could not be satisfied to be displayed on the output unit 340 of the client device 110, may output information by storing a file or the like including information on the constraint conditions that could not be satisfied in a predetermined storage area such as the storage unit 220, or may output information by transmitting information on the constraint conditions that could not be satisfied to a predetermined device. Note that, in the following, for the sake of simplicity of explanation, the explanation will be given assuming that the control unit 210 controls information on the constraint conditions to be displayed on the output unit 340 of the client device 110.
[0031] FIG. 7 is a diagram showing an example of a screen 700 displayed on the output unit 340 of the client device 110. More preferably, as shown in FIG. 7, the control unit 210 outputs, as information on the constraint condition, the constraint condition (-3x-2y≧6) where ui≠0.0 is satisfied, and information suggesting that the constraint condition (-3x-2y≧6) where ui≠0.0 is deleted or modified because the constraint condition is an unsatisfiable constraint condition. The area 710 is an area showing the constraint condition where ui≠0.0 is satisfied, and is an area for receiving input regarding modification. The delete button 720 is a button selected when instructing to delete the constraint condition displayed in the area 710. The modify button 730 is a button selected when instructing to rewrite the constraint condition in the area 710 with the modified constraint condition. The output constraint condition button 740 is a button selected when instructing to output another constraint condition that is inconsistent with the constraint condition displayed in the area 710 (the constraint condition cannot be satisfied).
[0032] In step S406, the control unit 210 determines whether or not the Output Constraint Conditions button 740 has been selected via a screen (for example, a screen as shown in FIG. 7) displayed on the output unit 340 of the client device 110. If the control unit 210 determines that the Output Constraint Conditions button 740 has been selected (YES in step S406), the process proceeds to step S801 in FIG. 8, and if the control unit 210 determines that the Output Constraint Conditions button 740 has not been selected, that is, the Delete button 720 or the Modify button 730 has been selected (NO in step S406), the process proceeds to step S407.
[0033] In step S407, the control unit 210 corrects the first linear programming problem based on input information, etc., input by the operator via a screen displayed on the output unit 340 of the client device 110 (for example, a screen such as that shown in FIG. 7). For example, when a Delete button 720 is selected on the screen as shown in Fig. 7, the control unit 210 performs a modification to delete the constraint condition displayed in the area 710 from the first linear programming problem. Alternatively, when a modified constraint condition is input in the area 710 on the screen as shown in Fig. 7 and a Modify button 730 is selected, the control unit 210 performs a modification to change the corresponding constraint condition of the first linear programming problem to the modified constraint condition. The process in step S407 is performed for u that did not become zero. i This is an example of a process for correcting a first linear programming problem based on input information input in response to output of information relating to a first constraint condition corresponding to
[0034] In step S408, the control unit 210 solves the modified first linear programming problem to calculate a solution. In step S409, the control unit 210 outputs the calculated solution. For example, the control unit 210 displays the calculated solution on the output unit 340 of the client device 110. In step S410, the control unit 210 stores the modified first linear programming problem in a predetermined memory area such as the memory unit 220 based on a predetermined operation via the screen by the operator of the client device 110 who has confirmed the solution.
[0035] FIG. 8 is a flowchart (part 2) showing an example of information processing in the server device 100. In step S801, the control unit 210 performs a second linear programming problem and i In the above example, since u3 was not zero, the control unit 210 generates a third linear programming problem based on the second linear programming problem and u3. The third objective function of the third linear programming problem includes n third constraint conditions and a third objective function. The third objective function is generated by subtracting u3 from u4, which was not zero in the second objective function. i It includes an objective function with weighting added to If we define wi as the weight given to violations of constraints, the third objective function is
number
[0036] FIG. 9 illustrates an example of a third linear programming problem 900 . As shown in FIG. 9, in the third objective function 910 of the third linear programming problem 900, a weight (10000 in the example of FIG. 9) is applied to ui (u3 in the above example) that was not zero in the second objective function. That is, in the example of FIG. 9, w3=10000. The weighting value is, for example, determined in advance and stored in a predetermined storage area such as the storage unit 220. The third constraint condition 920 of the third linear programming problem 900 is the same as the second constraint condition 620 of the second linear programming problem 600.
[0037] 8, the control unit 210 calculates a solution by solving the third linear programming problem 900. The constraint condition for which ui≠0.0 is the constraint condition that cannot be satisfied. Solving the third linear programming problem 900 gives: u1=0.0, u2=12.0, and u3=0.0. The process in step S802 calculates a solution to the third linear programming problem, and u that is not zero is i 1 is an example of a process for determining a first constraint condition corresponding to
[0038] In step S803, the control unit 210 outputs information related to the constraint conditions.
[0039] Fig. 10 is a diagram showing an example of a screen 1010 displayed on the output unit 340 of the client device 110. More preferably, as shown in Fig. 10, the control unit 210 outputs, as information on the constraints, information on the constraints that could not be satisfied (u2 in the above example) when the third linear programming problem 900 is solved, and information on the constraints that could not be satisfied (u3 in the above example) when the second linear programming problem 600, which contradicts the above constraints, is solved, as information on the constraints. In addition, the control unit 210 calculates the solution to the second linear programming problem, and outputs, as information on the combination, information on the constraints, on the constraints that were not zero when the second linear programming problem 600 is solved. i The first constraint corresponding to and the solution to the third linear programming problem are calculated, and the u i and the first constraint corresponding to the first constraint, and outputs information suggesting that at least one of them be deleted or modified. Area 1020 is an area that shows conflicting constraints and also an area that accepts input regarding modification and / or deletion. Delete button 1030 is a button that is selected when instructing to delete the constraint displayed in area 1020. Modify button 1040 is a button that is selected when instructing to rewrite the constraint displayed in area 1020 with the modified constraint.
[0040] The process in step S803 calculates a solution to the second linear programming problem, and u that is not zero is iThe first constraint corresponding to and the solution to the third linear programming problem are calculated, and the u i This is an example of a process for outputting information regarding a combination of a first constraint condition corresponding to and . The process in step S803 can also be considered as an example of a process for outputting information about a constraint condition that is inconsistent with the constraint condition output in step S405.
[0041] Proceeding to step S407 in FIG. 4, the control unit 210 corrects the first linear programming problem based on input information, etc. input by the operator via a screen displayed on the output unit 340 of the client device 110 (for example, a screen such as that shown in FIG. 7). For example, when a Delete button 1030 is selected on a screen such as that shown in Fig. 10, the control unit 210 performs a correction to delete all or any of the multiple constraint conditions displayed in the area 1020 from the first linear programming problem. Alternatively, when a corrected constraint condition is input in the area 1020 on a screen such as that shown in Fig. 10 and a Correct button 1040 is selected, the control unit 210 performs a correction to change the corresponding constraint condition of the first linear programming problem to the corrected constraint condition. This process is an example of a process to correct the first linear programming problem based on input information input in response to the output of information on the combination.
[0042] In step S408, the control unit 210 solves the modified first linear programming problem to calculate a solution. In step S409, the control unit 210 outputs the calculated solution. For example, the control unit 210 displays the calculated solution on the output unit 340 of the client device 110. In step S410, the control unit 210 stores the modified first linear programming problem in a predetermined memory area such as the memory unit 220 based on a predetermined operation via the screen by the operator of the client device 110 who has confirmed the solution.
[0043] According to the processing of the first embodiment, it is possible to identify constraint conditions that are in conflict with respect to solving a linear programming problem, and also to delete or modify the identified constraint conditions. In the above-described embodiment, for the sake of simplicity, an example of a linear programming problem as shown in Fig. 5 has been described. However, even if the number of variables and constraints is increased compared to the linear programming problem as shown in Fig. 5, the same effect can be obtained by repeatedly executing the above-described process.
[0044] Although the embodiments have been described above, they are presented as examples and are not intended to limit the scope of the invention. The new embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. The embodiments are within the scope and spirit of the invention, and are within the scope of the invention and its equivalents described in the claims. [Explanation of symbols]
[0045] 100: Server device 110: Client device 150: Network 210: Control section 220: Storage section 230: Communications Department 1000: Information processing systems
Claims
1. An information processing method executed by an information processing system, comprising: generating a second linear programming problem different from the first linear programming problem based on the first linear programming problem for which a constraint violation is to be detected; the first linear programming problem includes n first constraints and a first objective function; the second linear programming problem includes n second constraints and a second objective function; the second constraint condition is a relaxation of the first constraint condition by ui, The second objective function is: [0010] and Calculate a solution to the second linear programming problem, and output information about the first constraint condition corresponding to the ui that was not zero. Information processing methods.
2. 2. The information processing method according to claim 1, The said u did not become zero i and correcting the first linear programming problem based on input information input in response to outputting information about the first constraint condition corresponding to Information processing methods.
3. 2. The information processing method according to claim 1, The said u did not become zero i The information on the first constraint corresponding to the first constraint is information suggesting that the first constraint is deleted or modified. Information processing methods.
4. 2. The information processing method according to claim 1, The second linear programming problem and the non-zero u i and generating a third linear programming problem based on the third objective function of the third linear programming problem includes n third constraints and a third objective function; the third objective function is an objective function obtained by weighting the ui that is not zero in the second objective function, Calculate the solution to the third linear programming problem and check if the solution is not zero. i determining the first constraint corresponding to Calculate the solution to the second linear programming problem, and if it is not zero, i The first constraint corresponding to the third linear programming problem is calculated, and the solution of the third linear programming problem is calculated. i and outputting information regarding the combination of the first constraint condition corresponding to the first constraint condition. Information processing methods.
5. 5. The information processing method according to claim 4, solving the first linear programming problem based on input information input in response to the output of the information regarding the combination; Information processing methods.
6. 5. The information processing method according to claim 4, The information about the combination is used to calculate the solution to the second linear programming problem and to determine whether the solution is zero. i The first constraint corresponding to the third linear programming problem is calculated, and the solution of the third linear programming problem is calculated. i and a first constraint corresponding to the first constraint, Information processing methods.
7. An information processing system, At least one control unit is included, The control unit is generating a second linear programming problem different from the first linear programming problem based on the first linear programming problem for which a constraint violation is to be detected; the first linear programming problem includes n first constraints and a first objective function; the second linear programming problem includes n second constraints and a second objective function; the second constraint condition is a relaxation of the first constraint condition by ui, The second objective function is: [0025] and Calculate a solution to the second linear programming problem, and output information about the first constraint condition corresponding to the ui that was not zero. Information processing system.
8. A program, On the computer, A program for executing the information processing method according to any one of claims 1 to 6.
Citation Information
Patent Citations
Method and device for optimization problem processing
JP1990105969A
Material blend planning method, coke manufacturing method, solving method for mixed integer programming problem and material blend planning device
JP2020149607A
Planning apparatus, planning method, and planning program
JP2024066244A
Voltage reactive power monitoring controller
JP3372460B2
System, Method and Apparatus for Allocating Resources by Constraint Selection
US20080134193A1
Cited By
Mathematical optimization system, mathematical optimization method, and mathematical optimization program
WO2026211341A1
