2017 Fiscal Year Final Research Report
Development of pivoting algorithms based on global structure of linear programming
| Project/Area Number |
26330002
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Nihon University |
|---|
Principal Investigator |
|
|---|
| Research Collaborator |
FUKUDA Komei
SADAKANE Kunihiko
Gaertner Bernd
Bremner David
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Keywords | 線形計画 / 多面体 / マトロイド |
|---|
| Outline of Final Research Achievements |
Pivoting algorithms is known as a method in linear programming (LP), and it has been actively studied starting at the simplex method, proposed by Dantzig in 1947. A pivoting algorithm aims to proceed in the direction increasing the value of an objective function, and find the optimal solution. It is one of important unsolved problems of LPs to develop an pivoting algorithm in polynomial time. In this investigation, based on the fact that existing algorithms do not take global properties on polyhedral structure of LPs into account, we challenge the outstanding problem by utilizing global structure of LPs
|
| Free Research Field |
数理計画，組合せ幾何学
|
