Lagrangian Approach to Quasiconvex Programing

J.P. Penot
Additional contact information
J.P. Penot: University of Pau

Journal of Optimization Theory and Applications, 2003, vol. 117, issue 3, No 12, 637-647

Abstract: 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.

Keywords: Duality; Lagrangians; lower subdifferentials; mathematical programming; multipliers (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1023957924086 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:117:y:2003:i:3:d:10.1023_a:1023957924086

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1023957924086

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().