18517147. SOLUTION FINDING DEVICE, SOLUTION FINDING METHOD, AND COMPUTER PROGRAM PRODUCT simplified abstract (KABUSHIKI KAISHA TOSHIBA)
SOLUTION FINDING DEVICE, SOLUTION FINDING METHOD, AND COMPUTER PROGRAM PRODUCT
Organization Name
Inventor(s)
Masaru Suzuki of Ota Tokyo (JP)
SOLUTION FINDING DEVICE, SOLUTION FINDING METHOD, AND COMPUTER PROGRAM PRODUCT - A simplified explanation of the abstract
This abstract first appeared for US patent application 18517147 titled 'SOLUTION FINDING DEVICE, SOLUTION FINDING METHOD, AND COMPUTER PROGRAM PRODUCT
Simplified Explanation
The patent application describes a solution-finding device for solving a 0-1 combinatorial optimization problem under constraint conditions expressed using inequality expressions. The device includes an updating unit and an output unit.
- The updating unit sequentially updates the first and second variables for each element associated with the variables, alternating between them for each unit-time between initial and end timing.
- The output unit provides the solution of the optimization problem based on the first variable of each element at the end timing.
- During the updating operation, if the inequality expression with the first variable substituted is unsatisfied for any constraint condition, the updating unit subtracts a correction value from the second variable of the element based on the distance from the boundary of the inequality expression.
---
- Potential Applications
- Operations research
- Supply chain management
- Production planning
- Problems Solved
- Solving 0-1 combinatorial optimization problems efficiently
- Handling constraint conditions expressed using inequality expressions
- Benefits
- Improved optimization solutions
- Increased efficiency in decision-making processes
- Enhanced performance in various applications
- Potential Commercial Applications
- Optimizing Supply Chain Operations with Constraint Conditions
- Potential Commercial Applications
---
- Possible Prior Art
There are existing methods for solving combinatorial optimization problems, but the specific approach described in this patent application, involving updating variables under constraint conditions expressed using inequality expressions, appears to be novel.
---
- Unanswered Questions
- How does the device handle multiple constraint conditions simultaneously?
The abstract does not provide details on how the device manages and prioritizes multiple constraint conditions during the solution-finding process.
- What is the computational complexity of the solution-finding process?
The abstract does not mention the computational efficiency or complexity of the device in solving 0-1 combinatorial optimization problems under constraint conditions.
Original Abstract Submitted
A 0-1 combinatorial-optimization-problem is solved under constraint-conditions expressed using inequality expressions. A solution-finding device includes an updating-unit and an output-unit. For each of plural elements associated with first- and second-variables, the updating-unit sequentially updates, for each unit-time between initial-timing and end-timing, the first-variable and the second-variable alternatively. The output-unit outputs the solution of the 0-1 combinatorial-optimization-problem based on the first-variable of each of the plural elements at the end-timing. During the updating operation for each unit-time, for each of one or more constraint-conditions, when the inequality expression in which the first-variable corresponding to each of the plural discrete variables is substituted is unsatisfied; the updating-unit subtracts, from the second-variable of each of the plural elements, a correction value corresponding to the component of the element corresponding to the distance from the boundary of the inequality expression to positions identified by the plural elements.
