| 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)
|
|---|
| 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
|
