| Budget Amount *help |
¥13,910,000 (Direct Cost: ¥10,700,000、Indirect Cost: ¥3,210,000)
Fiscal Year 2018: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2017: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2016: ¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Fiscal Year 2015: ¥2,990,000 (Direct Cost: ¥2,300,000、Indirect Cost: ¥690,000)
Fiscal Year 2014: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
|
|---|
| Outline of Final Research Achievements |
Discrete Convex Analysis is a theory of optimization that transversally connects the continuous optimization and discrete optimization. The theory aims at establishing a general methodology applicable in various disciplines of engineering and social science by extracting and reformulating common mathematical structures found in various problems. In this research project we have obtained results on discrete DC (difference of convex) programming, integrally convex functions and discrete midpoint convex functions, axiomatizations and characterizations of M-convex functions, operations on discrete convex functions, etc. We have also explored applications of discrete convex analysis to auction theory in economics and game theory, inventory theory in operations research, valued constrained satisfaction problem in computer science.
|
