Lagrange multipliers and saddle points in multiobjective programming (Q1337207)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 679938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrange multipliers and saddle points in multiobjective programming |
scientific article; zbMATH DE number 679938 |
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
0 references
0 references
0.8499747514724731
0 references
0.8329697251319885
0 references
0.8263790607452393
0 references
