Abstract
This paper presents an algorithm for solving the following problem
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Awriel and A.C. Williams. Complementary geometric programming, SIAM, J. Appt. Math. 19(1974), 125–141.
M. Awriel and A.C. Williams. An extension of geometric programming with applications in engineering optimization, J. Eng. Math. 5(1971), 187–194.
P.P. Bansal and S.E. Jacobsen. Characterization of basic solutions for a class of nonconvex program, J. Optim. Theory and Applications 15 (1975), 549–564.
P.P. Bansal and S.E. Jacobsen. An algorithm for optimi- zing network flow capacity under economies-of-scale. J. Optim. Theory and Applications 15(1975), 565–586.
J. Falk and K.L. Hoffman. A successive underestimation method for concave minimization problem, Math. of Oper. Research N21, 1976, 251–259.
R.J. Hillestad. Optimization problems subject to a budget constraint with economies of scale, Operations Research 23, No.6, Nov-Dec 1975.
R.J. Hillestad and S.E. Jacobsen. Linear program with an additional reverse-convex constraint, Appl. Math. Optim., 6(1980), 257–269.
R.J. Hillestad and S.E. Jacobsen. Reverse-convex programming, Appl. Math. Optim., 6 (1980), 63–78.
R. Meyer. The validity of a family of optimization methods, SIAM, J. Control 8(1970), 41–54.
R.T. Rockafellar. Convex Analysis, Princeton Univ. Press, 1970.
J.B. Rosen. Iterative solution of non-linear optimal control problems, SIAM, J. Control, 4 (1966), 223–244.
T.V. Thieu, B.T. Tam and V.T. Ban. An outer approxi-mation method for globally minimizing a concave function over a compact convex set, IFIP Working Conference on Recent Advances on System Modelling and Optimization Hanoi, January 1983.
H. Tuy. Global minimization of a concave function subject to mixed linear and reverse-convex constraints, IFIP Working Conference on Recent Advances on System Modelling and Optimization Hanoi, January 1983.
H. Tuy. On outer approximation methods for solving concave minimization problems, Report N 2 108, Forschungwerkpunkt Dynamische System, Univ. Bremen 1983, Acta Mathematica Vietnamica (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Thuong, N., Tuy, H. (1985). A Finite Algorithm for Solving Linear Programs with an Additional Reverse Convex Constraint. In: Demyanov, V.F., Pallaschke, D. (eds) Nondifferentiable Optimization: Motivations and Applications. Lecture Notes in Economics and Mathematical Systems, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-12603-5_27
Download citation
DOI: https://doi.org/10.1007/978-3-662-12603-5_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15979-7
Online ISBN: 978-3-662-12603-5
eBook Packages: Springer Book Archive