A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we develop a branch-and-bound algorithm to solve a network flow problem of optimizing production and transportation simultaneously. The production cost is assumed to be a concave function in light of scale economy. The proposed algorithm generates a globally optimal solution to this nonconvex minimization problem in finite time, without assuming the separability of the production-cost function unlike existing algorithms. We also report some computational results, which indicate that the algorithm is fairly promising for practical use.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kuno Takahito

  University of Tsukuba

• Nagai Hidetoshi

  University of Tsukuba

関連論文

• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST

スポンサーリンク