Duality with generalized convexity
- 1 July 1986
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
- Vol. 28 (1) , 10-21
- https://doi.org/10.1017/s0334270000005154
Abstract
Recently, Hanson and Mond formulated a type of generalized convexity and used it to establish duality between the nonlinear programming problem and the Wolfe dual. Elsewhere, Mond and Weir gave an alternate dual, different from the Wolfe dual, that allowed the weakening of the convexity requirements. Here we establish duality between the nonlinear programming problem and the Mond-Weir dual using Hanson-Mond generalized convexity conditions.This publication has 6 references indexed in Scilit:
- Semi-infinite programmingEuropean Journal of Operational Research, 2007
- Generalized convexity in mathematical programmingBulletin of the Australian Mathematical Society, 1983
- A Strict Converse Duality Theorem in Nonlinear ProgrammingJournal of Information and Optimization Sciences, 1983
- Further Generalizations of Convexity in Mathematical ProgrammingJournal of Information and Optimization Sciences, 1982
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961
- Nonlinear ProgrammingPublished by University of California Press ,1951