Article Outline
Keywords
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Khayyal FA (1990) Jointly constrained bilinear programs and related problems: An overview. Comput Math Appl 19(11):53–62
Al-Khayyal FA, Falk JE (1983) Jointly constrained biconvex programming. Math Oper Res 8(2):273–286
Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: Theory and algorithms. Wiley, New York
Benson HP, Sayin S (1994) A finite concave minimization algorithm using branch and bound and neighbor generation. J Global Optim 5(1):1–14
Falk JE (1969) Lagrange multipliers and nonconvex programs. SIAM J Control 7:534–545
Falk JE, Hoffman K (1976) A successive underestimation method for concave minimization problems. Math Oper Res 1(3):251–259
Kalantari B, Rosen JB (1987) An algorithm for global minimization of linearly constrained concave quadratic functions. Math Oper Res 12(3):544–561
Sherali HD, Alameddine A (1990) An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes. Ann Oper Res 25(1–4):197–209
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Yajima, Y. (2008). Convex Envelopes in Optimization Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_95
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_95
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering