Title:
PROBLEM SOLUTION DEVICE, METHOD, AND PROGRAM
Document Type and Number:
WIPO Patent Application WO/2020/179624
Kind Code:
A1
Abstract:
The present invention enables finding of the solution of an optimization problem while suppressing the amount of calculation. An optimization problem reformulation unit 130 reformulates the optimization problem to be solved to an optimization problem in which the constraints on discrete variables and constraints on continuous variables are separated. A discrete variable optimization unit 160 fixes continuous variables to a certain point and optimizes discrete variables in the reformulated optimization problem. A continuous variable optimization unit 180 fixes discrete variables to a certain point and optimizes continuous variables in the reformulated optimization problem. A link changing unit 200 changes, in the reformulated optimization problem, a link coefficient that represents the influence of terms in which discrete and continuous variables are multiplied. A management unit 150 repeats each processing in the discrete variable optimization unit 160, the continuous variable optimization unit 180, and the link changing unit 200 until a predetermined stopping condition is satisfied.
More Like This:
Inventors:
HIKIMA YUYA (JP)
TODA HIROYUKI (JP)
KURASHIMA TAKESHI (JP)
AKAGI YASUNORI (JP)
TODA HIROYUKI (JP)
KURASHIMA TAKESHI (JP)
AKAGI YASUNORI (JP)
Application Number:
PCT/JP2020/008065
Publication Date:
September 10, 2020
Filing Date:
February 27, 2020
Export Citation:
Assignee:
NIPPON TELEGRAPH & TELEPHONE (JP)
International Classes:
G06N99/00
Other References:
YAMASAKI, S. ET AL.: "A Solution Method for Mixed Integer Quadratic Programming Problems - Application to Supply Chain Planning", PROCEEDINGS OF THE 51ST ANNUAL CONFERENCE OF THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE), 16 May 2007 (2007-05-16), Kyoto, pages 219 - 220
Attorney, Agent or Firm:
TAIYO, NAKAJIMA & KATO (JP)
Download PDF: