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
|
Project Status |
Completed (Fiscal Year 2017)
|
Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2016: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2015: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
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
|
Report
(5 results)
Research Products
(10 results)
-
[Journal Article] A Lower Bound on Opaque Sets2016
Author(s)
Akitoshi Kawamura, Sonoko Moriyama, Yota Otachi, Janos Pach
-
Journal Title
Proc. of the 32nd Symposium on Computational Geometry
Volume: 32
DOI
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
-
-
-
-
-
-
-