Advances in Geometric Programming pp 355-373 | Cite as
Global Solutions of Mathematical Programs with Intrinsically Concave Functions
Chapter
Abstract
An implicit enumeration technique for solving a certain type of nonconvex program is described. The method can be used for solving signomial programs with constraint functions defined by sums of quasiconcave functions and other types of programs with constraint functions called intrinsically concave functions. A signomial-type example is solved by this method. The algorithm is described together with a convergence proof. No computational results are available at present.
Keywords
Convex Subset Global Solution Concave Function Nonconvex Program Conditional Constraint
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.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Avriel, M., Solution of Certain Nonlinear Programs Involving R-Convex Functions, Journal of Optimization Theory and Applications, Vol. 11, pp. 159–174, 1973.MathSciNetCrossRefGoogle Scholar
- 2.Ben-Tal, A., On Generalized Means and Generalized Convexity, Journal of Optimization Theory and Applications, Vol. 21, pp. 1–13, 1977.MathSciNetMATHCrossRefGoogle Scholar
- 3.Mangasarian, O. L., Nonlinear Programming, McGraw-Hill Book Company, New York, New York, 1969.MATHGoogle Scholar
- 4.Hardy, G. H., Littlewood, J. E., and Polya, G., Inequalities, Cambridge University Press, Cambridge, England, 1952.MATHGoogle Scholar
- 5.Mangasarian, O. L., and Klinger, A., Logarithmic Convexity and Geometric Programming, Journal of Mathematical Analysis and Applications, Vol. 24, pp. 388–408, 1968.MathSciNetMATHCrossRefGoogle Scholar
- 6.Duffin, R. J., Peterson, E. L., and Zener, C., Geometric Theory and Application, John Wiley and Sons, New York, New York, 1967.MATHGoogle Scholar
- 7.Passy, U., Condensing Generalized Polynomials, Journal of Optimization Theory and Applications, Vol. 9, pp. 221–237, 1972.MathSciNetCrossRefGoogle Scholar
- 8.Tsherniak, D., The Global Solution of Signomial Programming, Technion, Haifa, Israel, MS Thesis, 1977.Google Scholar
Copyright information
© Plenum Press, New York 1980