Efficiency and solution approaches to bicriteria nonconvex programs (Q1368736)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiency and solution approaches to bicriteria nonconvex programs |
scientific article; zbMATH DE number 1067919
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiency and solution approaches to bicriteria nonconvex programs |
scientific article; zbMATH DE number 1067919 |
Statements
Efficiency and solution approaches to bicriteria nonconvex programs (English)
0 references
29 September 1997
0 references
The authors consider bicriteria optimization problems in finite dimensions. Based on the known \(\varepsilon\)-constranit auxiliary problem and a special augmented Lagrangian a scalarization technique is presented. The concepts of \(q_i\)-approachable points and a so-called augmented duality gap are proposed. The relationship between approachability and efficiency is studied, and the connectedness of the set of efficient points is investigated. Finally, the authors discuss a simple numerical example.
0 references
bicriteria optimization
0 references
augmented Lagrangian
0 references
