The following pages link to Epsilon efficiency (Q1062919):
Displaying 50 items.
- On Minty variational principle for nonsmooth vector optimization problems with approximate convexity (Q279827) (← links)
- A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions (Q365659) (← links)
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
- Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems (Q395853) (← links)
- On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
- Characterization of approximate solutions of vector optimization problems with a variable order structure (Q467457) (← links)
- Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces (Q467462) (← links)
- Concepts for approximate solutions of vector optimization problems with variable order structures (Q484490) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Optimality conditions for approximate solutions in multiobjective optimization problems (Q607984) (← links)
- The multicriteria big cube small cube method (Q611015) (← links)
- A generic approach to approximate efficiency and applications to vector optimization with set-valued maps (Q625654) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- A multiple objective interactive Lagrangean relaxation approach (Q800836) (← links)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- On approximate efficiency in multiobjective programming (Q857826) (← links)
- On approximate solutions in vector optimization problems via scalarization (Q861514) (← links)
- Some properties of approximate solutions for vector optimization problem with set-valued functions (Q969737) (← links)
- Tradeoff-based decomposition and decision-making in multiobjective programming (Q1042253) (← links)
- Strict approximate duality in vector spaces (Q1115349) (← links)
- Approximation in multiobjective optimization (Q1187837) (← links)
- The maximization of a function over the efficient set via a penalty function approach (Q1278284) (← links)
- Epsilon-dominating solutions in mean-variance portfolio analysis (Q1291760) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Convergence of relaxed minimizers in set optimization (Q1686557) (← links)
- Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity (Q1926610) (← links)
- Equivalent \(\varepsilon\)-efficiency notions in vector optimization (Q1939080) (← links)
- An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
- Ekeland variational principles involving set perturbations in vector equilibrium problems (Q2022330) (← links)
- On approximate efficiency for nonsmooth robust vector optimization problems (Q2153390) (← links)
- Speed optimizations for liner networks with business constraints (Q2184075) (← links)
- A bi-objective incomplete hub location-routing problem with flow shipment scheduling (Q2295274) (← links)
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications (Q2311117) (← links)
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems (Q2356347) (← links)
- Stability of minimizers of set optimization problems (Q2358761) (← links)
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization (Q2399486) (← links)
- Properties of the nonlinear scalar functional and its applications to vector optimization problems (Q2423789) (← links)
- Existence and optimality conditions for approximate solutions to vector optimization problems (Q2429404) (← links)
- \(\varepsilon\)-subdifferentials of set-valued maps and \(\varepsilon\)-weak Pareto optimality for multiobjective optimization (Q2433240) (← links)
- Exact generation of epsilon-efficient solutions in multiple objective programming (Q2460074) (← links)
- Approximate saddle points for constrained vector-valued games. (Q2468641) (← links)
- Optimality conditions for metrically consistent approximate solutions in vector optimization (Q2471086) (← links)
- Cone characterizations of approximate solutions in real vector optimization (Q2471114) (← links)
- Approximate saddle points for minmax problems and vector valued games. (Q2477080) (← links)
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization (Q2484629) (← links)
- Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps (Q2514680) (← links)
- Approximate properly solutions of constrained vector optimization with variable coradiant sets (Q2693792) (← links)
