Research on Discrete Convex Analysis Approach for Robust Nonlinear Integer Programming Problems
| Project/Area Number |
18K11177
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Review Section |
Basic Section 60020:Mathematical informatics-related
|
|---|
| Research Institution | Tokyo Institute of Technology |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2018-04-01 – 2023-03-31
|
| Project Status |
Completed (Fiscal Year 2022)
|
| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2021: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2020: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2019: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2018: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Keywords | 離散凸関数 / ロバスト最適化 / 離散最適化 / 離散凸解析 / 整数計画 |
|---|
| Outline of Final Research Achievements |
Discrete convex integer programming problem is a discrete optimization problem to find an integral vector minimizing a given discrete convex function under a given constraint. In this research, we consider a new problem called "a robust discrete convex integer programming problem" in which uncertainty arises in problem input. Based on my previous research results, we aimed at developing algorithms for this new problem which has theoretical guarantee in the quality of an obtained solution and computation time. We obtained various interesting results on robust version of several discrete optimization problems.
|
| Academic Significance and Societal Importance of the Research Achievements |
既存の離散最適化アルゴリズムは問題の入力データが正確に与えられたと言う前提で適用されるが，実際に解くべき問題においては，与えられた入力データが正確に分からないという状況が一般的である．このような理論と現実のギャップを埋めるための一助として，本研究成果は役立つと考えている．また，現実問題からの要請に基づき新たな問題の枠組みを提案したが，これにより研究の新たな方向性を見いだすことができ，離散最適化分野のさらなる発展に貢献できるものと思われる．
|
Report
(6 results)
Research Products
(28 results)
