journal articleresearch article

On Sufficiency and Duality for Generalized Quasiconvex Programs

Abstract

AbstractFor a nonlinear programming problem, under differentiability assumptions, Fritz John suffcient optimality conditions are stated. Also some duality theorems are proved for Mond-Weir type duals. All results are given under generalized convexity assumptions

Similar works

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.