A characterization of pseudoinvexity in multiobjective programming (Q2389834): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Necessary conditions for optimality of nondifferentiable convex multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean conditions and quasiduality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invex functions and constrained local minima / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sufficiency of the Kuhn-Tucker conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is invexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invex functions and generalized convexity in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convexity in multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective programming under generalized type I invexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality criteria and duality in multiple-objective optimization involving generalized invexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank

Latest revision as of 19:51, 1 July 2024

scientific article
Language Label Description Also known as
English
A characterization of pseudoinvexity in multiobjective programming
scientific article

    Statements

    A characterization of pseudoinvexity in multiobjective programming (English)
    0 references
    19 July 2009
    0 references
    multiobjective programming
    0 references
    invexity
    0 references
    pseudoinvexity
    0 references
    efficient solution
    0 references
    weakly efficient solution
    0 references
    vector critical point
    0 references

    Identifiers