18368717. OPTIMIZATION METHOD AND INFORMATION PROCESSING APPARATUS simplified abstract (Hitachi, Ltd.)
Contents
OPTIMIZATION METHOD AND INFORMATION PROCESSING APPARATUS
Organization Name
Inventor(s)
OPTIMIZATION METHOD AND INFORMATION PROCESSING APPARATUS - A simplified explanation of the abstract
This abstract first appeared for US patent application 18368717 titled 'OPTIMIZATION METHOD AND INFORMATION PROCESSING APPARATUS
Simplified Explanation: The patent application describes a method for efficiently solving a quadratic programming problem with k-hot constraints for binary variables using an information processing apparatus.
- The invention involves solving quadratic programming problems with k-hot constraints for binary variables.
- The information processing apparatus relaxes binary variables into continuous values by adding correction values to nonlinear coefficients.
- The solution search is executed while satisfying the k-hot constraints through state transitions to maintain a constant sum of continuous variables.
Key Features and Innovation:
- Efficiently solves quadratic programming problems with k-hot constraints for binary variables.
- Utilizes an information processing apparatus to relax binary variables into continuous values.
- Executes a solution search while satisfying k-hot constraints through state transitions.
Potential Applications: The technology can be applied in various fields such as finance, engineering, logistics, and operations research for optimization problems with binary variables.
Problems Solved: The technology addresses the challenge of efficiently solving quadratic programming problems with k-hot constraints for binary variables.
Benefits:
- Improved efficiency in solving optimization problems with binary variables.
- Enhanced accuracy in satisfying k-hot constraints.
- Potential cost savings and time efficiency in various industries.
Commercial Applications: Optimization software companies can integrate this technology into their products to offer more efficient solutions for quadratic programming problems with k-hot constraints.
Prior Art: Readers can explore prior research on quadratic programming, k-hot constraints, and optimization algorithms in academic journals and patent databases.
Frequently Updated Research: Stay updated on advancements in quadratic programming algorithms, optimization techniques, and applications in various industries.
Questions about Quadratic Programming with k-hot Constraints: 1. How does the technology of relaxing binary variables into continuous values improve the solution search process? 2. What are the potential real-world applications of solving quadratic programming problems with k-hot constraints efficiently?
Original Abstract Submitted
An object is to efficiently solve a quadratic programming problem having a k-hot constraint (k is a positive integer) for binary variables. A preferred aspect of the invention is an optimization method for, using an information processing apparatus, solving a quadratic programming problem in which one or more independent k-hot constraints are imposed on binary variables, the information processing apparatus including a processor, a storage device, an input device, and an output device. The information processing apparatus relaxes the binary variables into continuous values by adding correction values to a nonlinear coefficients of the binary variables on which the k-hot constraints are imposed, and the information processing apparatus executes a solution search while satisfying the k-hot constraints by executing a state transition such that a sum of a set of continuous variables on which the k-hot constraint is imposed is constant.
