Pages that link to "Item:Q1053611"

The following pages link to \(\epsilon\)-solutions in vector minimization problems (Q1053611):

Displaying 50 items.

• Approximate solutions of multiobjective optimization problems (Q259809) (← links)
• Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints (Q262318) (← links)
• Using KKM technique in set-valued optimization problems and variational-like inequalities (Q266357) (← links)
• Characterizations of improvement sets via quasi interior and applications in vector optimization (Q276329) (← links)
• 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)
• Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency (Q395599) (← links)
• Lagrangian conditions for approximate solutions on nonconvex set-valued optimization problems (Q395853) (← links)
• On the equilibria of generalized dynamical systems (Q398543) (← links)
• On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
• \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions (Q414494) (← links)
• On approximate solutions in set-valued optimization problems (Q442729) (← links)
• Characterization of approximate solutions of vector optimization problems with a variable order structure (Q467457) (← links)
• Concepts for approximate solutions of vector optimization problems with variable order structures (Q484490) (← links)
• Covers and approximations in multiobjective optimization (Q513168) (← links)
• \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps (Q514685) (← links)
• Approximating the Pareto optimal set using a reduced set of objective functions (Q613484) (← links)
• Stability of solution mappings for parametric bilevel vector equilibrium problems (Q725789) (← links)
• Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints (Q778155) (← links)
• Approximate solutions and Levitin-Polyak well-posedness for set optimization using weak efficiency (Q779866) (← links)
• Approximate weakly efficient solutions of set-valued vector equilibrium problems (Q824682) (← links)
• A generalized Ekeland vector variational principle and its applications in optimization (Q838075) (← links)
• The Ekeland variational principle for Henig proper minimizers and super minimizers (Q847061) (← links)
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
• Ekeland's variational principle and its equivalent theorems in vector optimization (Q933461) (← links)
• Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions (Q965046) (← links)
• Choquet boundaries and efficiency (Q1005816) (← links)
• Tradeoff-based decomposition and decision-making in multiobjective programming (Q1042253) (← links)
• On two generalizations of Pareto minimality (Q1093550) (← links)
• Strict approximate duality in vector spaces (Q1115349) (← links)
• Pareto optimizing and scalarly stationary sequences (Q1270854) (← links)
• Generalized variational principle and vector optimization (Q1586824) (← links)
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems (Q1594871) (← links)
• Borwein-Preiss vector variational principle (Q1683267) (← links)
• Convergence of relaxed minimizers in set optimization (Q1686557) (← links)
• Approximate quasi efficiency of set-valued optimization problems via weak subdifferential (Q1689268) (← links)
• A kind of unified proper efficiency in vector optimization (Q1724630) (← links)
• A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures (Q1727958) (← links)
• Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
• Coradiant-valued maps and approximate solutions in variable ordering structures (Q1734112) (← links)
• Vector optimization with generalized cone locally connected functions (Q1790403) (← links)
• \(\varepsilon\)-optimality and duality for multiobjective fractional programming (Q1806494) (← links)
• Convergence of minimal and approximate minimal elements of sets in partially ordered vector spaces (Q1819001) (← links)
• A new maximal point theorem (Q1891947) (← links)
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
• An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems (Q1990434) (← links)
• An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)