On approximate efficiency in multiobjective programming (Q857826): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990923130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Solutions in Convex Vector Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate solutions in vector optimization problems via scalarization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several concepts for \(\varepsilon\)-efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of solutions for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887340 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability for convex vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order necessary conditions in set constrained differentiable vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3860434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\varepsilon\)-optimality and duality for multiobjective fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonconvex vector minimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two generalizations of Pareto minimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of ekellandz’s variational principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate saddle-point theorems in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon-dominating solutions in mean-variance portfolio analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Epsilon approximate solutions for multiobjective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753339 / rank
 
Normal rank

Latest revision as of 10:53, 25 June 2024

scientific article
Language Label Description Also known as
English
On approximate efficiency in multiobjective programming
scientific article

    Statements

    On approximate efficiency in multiobjective programming (English)
    0 references
    5 January 2007
    0 references
    A new definition for approximate efficiency is given for vector, that is, multi-objective optimization. Relations of this new \(\varepsilon\)-efficiency with existing corresponding approximate efficiency concepts are studied. Necessary and sufficient conditions for \(\varepsilon\)-efficiency are presented for convex problems using the well-known weighting method. In this setting, also parametric representations are discussed.
    0 references
    multi-objective optimization
    0 references
    \(\varepsilon\)-efficiency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers