Strongly polynomial time algorithms for certain concave minimization problems on networks

doi:10.1016/0167-6377(93)90102-M

Operations Research Letters

Volume 14, Issue 2, September 1993, Pages 99-109

https://doi.org/10.1016/0167-6377(93)90102-M Get rights and content

Abstract

A parametric method is proposed for solving a special production — transportation problem with two factories, and the minimum concave cost flow problem on a single source uncapacitated network with a single nonlinear arc cost. The resulting algorithms are strongly polynomial. The algorithm for the network flow problem is an improved version of an earlier polynomial algorithm of Guisewite and Pardalos.

References (17)

A.V. Aho et al.
Data Structures and Algorithms
(1987)
S. Cosares and D.S. Hochbaum, “Strongly polynomial algorithms for the quadratic transportation problem with a fixed...
W. Dinkelbach
On nonlinear fractional programming
Management Sci.
(1967)
F. Forgo
The solution of a special quadratic programming problem
Szigma
(1975)
M.L. Fredman et al.
Fibonacci heaps and their uses in improved network optimization algorithms
R. Gabasov et al.
Linear Programming Methods
(1980)
G.M. Guisewite et al.
A polynomial time solvable concave network flow problem
Networks
(1993)
B. Klinz et al.
Minimum concave cost network flow problems with a single nonlinear arc cost

There are more references available in the full text version of this article.

Cited by (17)

A general purpose exact solution method for mixed integer concave minimization problems
2023, European Journal of Operational Research
In this article, we discuss an exact algorithm for solving mixed integer concave minimization problems. A piecewise inner-approximation of the concave function is achieved using an auxiliary linear program that leads to a bilevel program, which provides a lower bound to the original problem. The bilevel program is reduced to a single level formulation with the help of Karush–Kuhn–Tucker (KKT) conditions. Incorporating the KKT conditions lead to complementary slackness conditions that are linearized using BigM, for which we identify a tight value for general problems. Multiple bilevel programs, when solved over iterations, guarantee convergence to the exact optimum of the original problem. Though the algorithm is general and can be applied to any optimization problem with concave function(s), in this paper, we solve two common classes of operations and supply chain problems; namely, the concave knapsack problem, and the concave production-transportation problem. The computational experiments indicate that our proposed approach outperforms the customized methods that have been used in the literature to solve the two classes of problems by an order of magnitude in most of the test cases.
Bounds for global optimization of capacity expansion and flow assignment problems
2000, Operations Research Letters
This paper provides new bounds related to the global optimization of the problem of mixed routing and bandwidth allocation in telecommunication systems. The combinatorial nature of the problem, related to arc expansion decisions, is embedded in a continuous objective function that encompasses congestion and investment line costs. It results in a non-convex multicommodity flow problem, but we explore the separability of the objective function and the fact that each associated arc cost function is piecewise-convex. Convexifying each arc cost function enables the use of efficient algorithms for convex multicommodity flow problems, and we show how to calculate sharp bounds for the approximated solutions.
Minimizing a linear multiplicative-type function under network flow constraints
1997, Operations Research Letters
In this paper, we consider a special class of nonconvex network flow problems, whose objective function is a product of two affine functions. This problem arises when one tries to send as much flow as possible in an ordinary two-terminal network at the minimum possible cost. We will show that a primal-dual algorithm can generate a globally optimal solution in pseudo-polynomial time and a globally ε-optimal solution in polynomial time.
A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
1996, Mathematical Programming, Series B
We show that the production-transportation problem involving an arbitrary fixed number of factories with concave production cost is solvable in strongly polynomial time. The algorithm is based on a parametric approach which takes full advantage of the specific structure of the problem: monotonicity of the objective function along certain directions, small proportion of nonlinear variables and combinatorial properties implied by transportation constraints.
A discussion on non-convex optimization problems arising in supply chain design and finance
2023, Advancement in Business Analytics Tools for Higher Financial Performance
A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems
2022, arXiv

View all citing articles on Scopus

View full text

Strongly polynomial time algorithms for certain concave minimization problems on networks

Abstract

Data Structures and Algorithms

On nonlinear fractional programming

Management Sci.

The solution of a special quadratic programming problem

Szigma

Fibonacci heaps and their uses in improved network optimization algorithms

Linear Programming Methods

A polynomial time solvable concave network flow problem

Networks

Minimum concave cost network flow problems with a single nonlinear arc cost