Strongly polynomial algorithm for a production-transportation problem with concave production cost

DOI10.1080/02331939308843882zbMath0818.65052OpenAlexW2012438528MaRDI QIDQ3835663

Hoang Tuy, Peter Värbrand, Athanasios Migdalas, Saied Ghannadan

Publication date: 15 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939308843882

zbMATH Keywords

global optimizationcombinatorial optimizationfacility locationstrongly polynomial algorithmconcave minimization problemproduction-transportation problemparametric transportation problemrank \(r\) property

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Production models (90B30)

Related Items

Minimizing a linear multiplicative-type function under network flow constraints, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, A general purpose exact solution method for mixed integer concave minimization problems, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Strongly polynomial algorithm for two special minimum concave cost network flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• Quadratic programming with one negative eigenvalue is NP-hard
• The complementary convex structure in global optimization
• Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
• The simple plant location problem: Survey and synthesis
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Dynamic Version of the Economic Lot Size Model
• Decomposing the requirement space of a transporation problem into polyhedral cones
• An efficient solution method for rank two quasiconcave minimization problems
• Optimal Facility Location with Concave Costs
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• Convex separable optimization is not much harder than linear optimization