Lagrangian function and duality theory in multiobjective programming with set functions (Q1090246)
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 4006000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lagrangian function and duality theory in multiobjective programming with set functions |
scientific article; zbMATH DE number 4006000 |
Statements
Lagrangian function and duality theory in multiobjective programming with set functions (English)
0 references
1988
0 references
Using the concept of vector-valued Lagrangian functions, we characterize a special class of solutions, D-solutions, of a multiobjective programming problem with set functions in which the domination structure is described by a closed convex cone D. Properties of two perturbation functions, primal map and dual map, are also studied. Results lead to a general duality theorem.
0 references
vector-valued Lagrangian functions
0 references
D-solutions
0 references
multiobjective programming
0 references
perturbation functions
0 references
0 references
0.8790614604949951
0 references
0.8667807579040527
0 references
0.850890040397644
0 references
0.8490024209022522
0 references
0.8429540395736694
0 references
