Necessary and sufficient conditions in constrained optimization
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
Additional conditions are attached to the Kuhn-Tucker conditions giving a set of conditions which are both necessary and sufficient for optimality in constrained optimization, under appropriate constraint qualifications. Necessary and sufficient conditions are also given for optimality of the dual problem. Duality and converse duality are treated accordingly.
- M. A. Hanson, “On sufficiency of the Kuhn-Tucker conditions”,Journal of Mathematical Analysis and Applications 80 (1981) 545–550. CrossRef
- M. A. Hanson and B. Mond, “Further generalizations of convexity in mathematical programming”,Journal of Information and Optimization Sciences (1982) 25–32.
- B. Mond and M. A. Hanson, “On duality with generalized convexity”,Mathematische Operationsforschung und Statistik Series Optimization 15 (1984) 313–317.
- O.L. Mangasarian,Nonlinear Programming (McGraw-Hill, New York, 1969).
- M.A. Hanson, “A duality theorem in nonlinear programming with nonlinear constraints”,Australian Journal of Statistics 3 (1961) 67–71. CrossRef
- P. Huard, “Dual programs”,IBM Journal of Research and Development 6 (1962) 137–139. CrossRef
- A. Ben-Israel and B. Mond, “What is invexity?”Journal of the Australian Mathematical Society Series B 28 (1986) 1–9. CrossRef
- R.M. Thrall and L. Tornheim,Vector Spaces and Matrices (Wiley, New York, 1957).
- Necessary and sufficient conditions in constrained optimization
Volume 37, Issue 1 , pp 51-58
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Necessary and sufficient conditions
- Kuhn-Tucker conditions
- invexity, type I and type II functions
- converse duality
- Industry Sectors