Abstract
In this paper, global optimization of linear programs with an additional reverse convex constraint is considered. This type of problem arises in many applications such as engineering design, communications networks, and many management decision support systems with budget constraints and economies-of-scale. The main difficulty with this type of problem is the presence of the complicated reverse convex constraint, which destroys the convexity and possibly the connectivity of the feasible region, putting the problem in a class of difficult and mathematically intractable problems. We present a cutting plane method within the scope of a branch-and-bound scheme that efficiently partitions the polytope associated with the linear constraints and systematically fathoms these portions through the use of the bounds. An upper bound and a lower bound for the optimal value is found and improved at each iteration. The algorithm terminates when all the generated subdivisions have been fathomed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.A. Amouzegar and K. Moshirvaziri, A penalty method for linear bilevel programming problems, in: Multilevel Optimization: Algorithms, Complexity and Applications, eds. A. Migdalas, M. Pardalos and P. Värbrand (Kluwer Academic, 1997) chapter 11.
M.A. Amouzegar and K.Moshirvaziri, Determining optimal pollution control policies: An application of bilevel programming, European Journal of Operational Research 119(1) (1999).
P.P. Bansal and S.E. Jacobsen, Characterization of basic solutions for a class of nonconvex programs, Journal of Optimization Theory and Applications 15 (1975) 549–564.
R.J. Hillestad, Optimization problems subject to a budget constraint with economies of scale, Operations Research 23(6) (1975) 1091–1098.
R.J. Hillestad and S.E. Jacobsen, Linear programs with an additional reverse-convex constraint, Journal of Applied Mathematics and Optimization 6 (1980) 257–269.
R.J. Hillestad and S.E. Jacobsen, Reverse-convex programming, Journal of Applied Mathematics and Optimization 6 (1980) 63–78.
R. Horst and N.V. Thoai, Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems, Computing 42 (1989) 271–289.
R. Horst and H. Tuy, Global Optimization: Deterministic Approaches (Springer, Berlin, 1990).
S.E. Jacobsen and K. Moshirvaziri, Computational experience using an edge search algorithm for linear reverse convex program, Journal of Global Optimization 9(2) (1996) 153–167.
K. Moshirvaziri and M.A. Amouzegar, A subdivision strategy for reverse convex programming problems, in: 32nd Operational Research Society of New Zealand Conference Proceedings (1996) pp. 181-187.
K. Moshirvaziri and M.A. Amouzegar, A subdivisional scheme for linear programs with an additional reverse convex constraint, Asia-Pacific Journal of Operational Research APJOR 15 (1998) 179–192.
N.V. Thuong and H. Tuy, A Finite Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint, Lecture Notes in Economics and Mathematical Systems 225 (Springer, 1985) pp. 291–302.
H. Tuy, Convex programs with an additional reverse convex constraint, Journal of Optimization Theory and Applications 52(3) (1987) 463–485.
U. Ueing, A combinatorial method to compute a global solution of certain non-convex optimization problems, in: Numerical Methods for Nonlinear Optimization, ed. F.A. Lootsma (Academic Press, 1972) pp. 223-230.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Moshirvaziri, K., Amouzegar, M.A. A Cutting Plane Algorithm for Linear Reverse Convex Programs. Annals of Operations Research 105, 201–212 (2001). https://doi.org/10.1023/A:1013361800945
Issue Date:
DOI: https://doi.org/10.1023/A:1013361800945