Sufficient optimality conditions and duality for a quasiconvex programming problem
- Cite this article as:
- Bector, C.R., Chandra, S. & Bector, M.K. J Optim Theory Appl (1988) 59: 209. doi:10.1007/BF00938309
- 136 Downloads
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.