Approximate saddle-point theorems in vector optimization (Q1821701): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Conjugate maps and duality in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality theory for maximizations with respect to cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: ε-Optimal solutions in nondifferentiable convex programming and some related questions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality theory in multiobjective programming / rank
 
Normal rank

Latest revision as of 19:31, 17 June 2024

scientific article
Language Label Description Also known as
English
Approximate saddle-point theorems in vector optimization
scientific article

    Statements

    Approximate saddle-point theorems in vector optimization (English)
    0 references
    0 references
    1987
    0 references
    The paper contains definitions of different types of nondominated approximate solutions to vector optimization problems and gives some of their elementary properties. Then, saddle-point theorems corresponding to these solutions are presented with an application relative to approximate primal-dual pairs of solutions.
    0 references
    0 references
    nondominated approximate solutions
    0 references
    vector optimization
    0 references
    saddle-point theorems
    0 references
    approximate primaldual pairs of solutions
    0 references
    convex optimization
    0 references
    0 references