| Project/Area Number |
12450040
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Engineering fundamentals
|
|---|
| Research Institution | The University of Tokyo (2002)
Kyoto University (2000-2001) |
|---|
Principal Investigator |
MUROTA Kazuo Graduate School of Information Sciences and Technology, Professor, 大学院・情報理工学系研究科, 教授 (50134466)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TAMURA Akihisa Kyoto University, Research Institute for Mathematical Sciences, Associate Professor, 数理解析研究所, 助教授 (50217189)
MATUURA Shiro Graduate School of Information Sciences and Technology, Research Associate, 大学院・情報理工学系研究科, 助手 (00332619)
MATSUI Tomomi Graduate School of Information Sciences and Technology, Associate Professor, 大学院・情報理工学系研究科, 助教授 (30270888)
FURIHATA Daisuke Osaka University, Cybermedia Center, Associate Professor, サイバーメディアセンター, 助教授 (80242014)
SHIOURA Akiyoshi Tohoku University, Graduate School of Information Sciences, Associate Professor, 大学院・情報科学研究科, 助教授 (10296882)
|
|---|
| Project Period (FY) |
2000 – 2002
|
| Project Status |
Completed (Fiscal Year 2002)
|
| Budget Amount *help |
¥7,600,000 (Direct Cost: ¥7,600,000)
Fiscal Year 2002: ¥2,000,000 (Direct Cost: ¥2,000,000)
Fiscal Year 2001: ¥1,400,000 (Direct Cost: ¥1,400,000)
Fiscal Year 2000: ¥4,200,000 (Direct Cost: ¥4,200,000)
|
|---|
| Keywords | convex analysis / convex function / convex set / matroid / discrete optimization / mathematical programming / nonlinear programming / network flow / 離散凸解析 / 数理経済学 / 不可分財市場 / 競争均衡 / M凸関数最小化 / アルゴリズム |
|---|
| Research Abstract |
The main aim of this research project is to exploit applications of the theory of discrete convex analysis proposed by the head investigator in the last decade. In this research project, we obtained various results described below. All of the results are presented at refereed international conferences and/ or accepted for publications in international scientific journals.
(1) In the area of mathematical economics we obtained three results as applications of discrete convex analysis. First of all, we developed a theory for economic equilibrium models with indivisible goods ; in particular, we investigated sufficient conditions for the existence of competitive equilibrium in an exchange economy with indivisible goods. Secondly, we provide new characterizations of M-convex functions which play a central role in discrete convex analysis. These characterizations are based on well-known concepts in mathematical economics such as the gross substitutes condition and the single improvement condition. Thirdly, we developed an algorithm for computing a competitive equilibrium in an exchange economy with indivisible goods. This algorithm is based on M-convex submodular flow problem which is an optimization problem in discrete convex analysis.
(2) We showed a proximity theorem for M-convex function minimization and developed fast algorithms.
(3) We discussed combinatorial structure in engineering system from the viewpoint of discrete convex analysis. In particular, we investigated the delta matroid parity problem with the aim of determining the solvability of electrical circuits, and developed an efficient algorithm.
(4) We verified applicability of the algorithms in discrete convex analysis to several problems in operations research. Based on this result, we developed efficient algorithms for the network design problem and the max cut problem.
|
