Efficiency and solution approaches to bicriteria nonconvex programs (Q1368736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Matthew L. TenHuisen / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Johannes Jahn / rank
Normal rank
 
Property / author
 
Property / author: Matthew L. TenHuisen / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Johannes Jahn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1008270131268 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W25457782 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:50, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficiency and solution approaches to bicriteria nonconvex programs
scientific article

    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
    0 references

    Identifiers