Abstract
An efficient algorithm is developed for solving linear programs with an additional reverse convex constraint having a special structure. Computational results are presented and discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. M. Freund and J. N. Orlin (1985), On the complexity of four set containment problems,Mathematical Programming 33, 139–145.
J. M. Henderson and R. E. Quandt (1971),Microeconomic Theory, McGraw-Hill, New York.
R. Horst and H. Tuy (1990),Global Optimization, Springer-Verlag, Berlin Heidelberg New York.
B. Klinz and H. Tuy (1993), Minimum concave-cost network flow problems with a single nonlinear arc cost, in Ding-Zhu Du and P. M. Pardalos (eds.),Network Optimization Problems, World Scientific, 125–143.
H. Konno and M. Inori (1988), Bond portfolio optimization by bilinear fractional programming,Journal of the Operations Research Society Japan 32, 143–158.
H. Konno and T. Kuno (1992), Linear Multiplicative Programming,Mathematical Programming, to appear.
H. Konno, Y. Yajima and T. Matsui (1991), Parametric simplex algorithms for solving a special class of nonconvex minimization problems,Journal of Global Optimization 1, 65–82.
T. Kuno, H. Konno and Y. Yamamoto (1991), Parametric successive underestimation method for convex programming problems with an additional convex multiplicative constraint,Journal of Global Optimization 1, 267–286.
K. Maling, S. H. Mueller and W. R. Heller (1982), On finding most optimal rectangular package plans,Proc. of the 19th Design Automation Conference, 663–670.
P. M. Pardalos (1988), On the global minimization of the product of two linear functions over a polytope, Preprint, Computer Science Department, Pennsylvania State University.
U. Pferschy (1991), Mathematical programs with a two-dimensional reverse convex constraint, diploma thesis, Institute of Mathematics, University of Technology, Graz.
U. Pferschy (1991), Reverse convex programs dealing with the product of two affine functions, Numerical experiments, Institute of Mathematics, University of Technology, Graz.
S. Suzuki, P. T. Thach and T. Tanaka (1989), On methods for minimizing the product of two convex functions, Preprint, Institute of Mathematics, Hanoi.
P. T. Thach, R. E. Burkard and W. Oettli (1991), Mathematical programs with a two-dimensional reverse convex constraint,Journal of Global Optimization 1, 145–154.
H. Tuy (1992), The complementary convex structure in global optimization,Journal of Global Optimization 2, 21–40.
H. Tuy, A. Migdalas and P. Varbrand (1993), A global optimization approach for the linear two level program,Journal of Global Optimization 3, 1–24.
H. Tuy and B. T. Tarn (1992), An efficient solution method for the rank two quasiconcave minimization problems,Optimization 24, 43–56.
H. Tuy and N. V. Thuong (1984), A finite algorithm for solving linear programs with an additional reverse convex constraint,Lecture Notes in Economics and Mathematical Systems 255, 291–304, Springer.
Y. Yajima and H. Konno (1991), Efficient algorithms for solving rank two and rank three bilinear programming problems,Journal of Global Optimization 1, 155–171.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pferschy, U., Tuy, H. Linear programs with an additional rank two reverse convex constraint. J Glob Optim 4, 441–454 (1994). https://doi.org/10.1007/BF01099268
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01099268