Journal of Optimization Theory and Applications. 117(3):637–647, JUNE 2003

Issn Print: 0022-3239

Publication Date: June 2003


Share this on facebook   Share this on Twitter   Share this on LinkedIn   Email this article  



Print

Lagrangian Approach to Quasiconvex Programing

J. Penot;

+ Author Information


    loading  Checking for direct PDF access through Ovid

Abstract

For a mathematical programming problem, we consider a Lagrangian approach inspired by quasiconvex duality, but as close as possible to the usual convex Lagrangian. We focus our attention on the set of multipliers and we look for their interpretation as generalized derivatives of the performance function associated with a simple perturbation of the given problem. We do not use quasiconvex dualities, but simple direct arguments.

Related Topics

    Related Articles

        loading  Loading Related Articles