Lagrange multipliers and saddle points in multiobjective programming (Q1337207): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GravEn / rank | |||
Normal rank | |||
Revision as of 21:09, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lagrange multipliers and saddle points in multiobjective programming |
scientific article |
Statements
Lagrange multipliers and saddle points in multiobjective programming (English)
0 references
4 December 1994
0 references
This paper presents some characterizations of ``subconvexlike'' vector functions, that is, functions which are convexlike with respect to the interior of the underlying ordering cone. Then it provides existence conditions for Lagrange multipliers of a subconvexlike multiobjective problem and for weak saddle points of the associated Lagrange function.
0 references
subconvexlike vector functions
0 references
existence conditions for Lagrange multipliers
0 references
weak saddle points
0 references
