Sufficient optimality conditions and duality for a quasiconvex programming problem

C. R. Bector, S. Chandra and M. K. Bector

View Related Documents

Abstract

Under differentiability assumptions, Fritz John Sufficient optimality conditions are proved for a nonlinear programming problem in which the objective function is assumed to be quasiconvex and the constraint functions are assumed to quasiconcave/strictly pseudoconcave. Duality theorems are proved for Mond-Weir type duality under the above generalized convexity assumptions.

Key Words  Fritz John sufficient optimality conditions - Mond-Weir duality

Communicated by G. Leitmann
The first author is thankful to the Natural Science and Engineering Research Council of Canada for financial support through Grant No. A-5319. The authors are thankful to Professor B. Mond for suggestions that improved the original draft of the paper.

Fulltext Preview

Image of the first page of the fulltext document