Robust optimization revisited via robust vector Farkas lemmas (Q5277989): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333887093 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q124850909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary conditions for super minimizers in constrained multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved definition of proper efficiency for vector maximization with respect to cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper Efficient Points for Maximizations with Respect to Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super Efficiency in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjugate duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas' lemma: three decades of generalizations for mathematical optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency and the theory of vector maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear semi-infinite programming duality under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions to multi-objective linear programs with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper efficiency with respect to cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution concepts in vector optimization: a fresh look at an old story / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Duality in Robust Convex Programming: Complete Characterizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Farkas' lemma for uncertain linear systems with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-valued Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust conjugate duality for convex optimization under uncertainty with application to data classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Optimization with Infimum and Supremum / rank
 
Normal rank

Latest revision as of 02:27, 14 July 2024

scientific article; zbMATH DE number 6744304
Language Label Description Also known as
English
Robust optimization revisited via robust vector Farkas lemmas
scientific article; zbMATH DE number 6744304

    Statements

    Robust optimization revisited via robust vector Farkas lemmas (English)
    0 references
    0 references
    12 July 2017
    0 references
    vector optimization
    0 references
    robust optimization
    0 references
    Farkas lemma
    0 references
    optimality conditions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references