Pages that link to "Item:Q3111144"

The following pages link to Solution concepts in vector optimization: a fresh look at an old story (Q3111144):

Displaying 33 items.

• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
• A Minty variational principle for set optimization (Q465450) (← links)
• Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
• Variational inequalities characterizing weak minimality in set optimization (Q495729) (← links)
• Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
• Applying set optimization to weak efficiency (Q828871) (← links)
• A set optimization approach to zero-sum matrix games with multi-dimensional payoffs (Q1631178) (← links)
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
• A set optimization approach to utility maximization under transaction costs (Q1693856) (← links)
• The vector linear program solver Bensolve -- notes on theoretical background (Q1753500) (← links)
• Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
• The Hopf-Lax formula for multiobjective costs with non-constant discount via set optimization (Q2102111) (← links)
• A norm minimization-based convex vector optimization algorithm (Q2156397) (← links)
• Lagrange duality in set optimization (Q2247892) (← links)
• Editorial. Choosing sets: preface to the special issue on set optimization and applications (Q2304903) (← links)
• A new concept of slope for set-valued maps and applications in set optimization studied with Kuroiwa's set approach (Q2304910) (← links)
• New Farkas-type results for vector-valued functions: a non-abstract approach (Q2315254) (← links)
• Farkas-type results for vector-valued functions with applications (Q2363561) (← links)
• Set Optimization—A Rather Short Introduction (Q2805754) (← links)
• A Survey of Set Optimization Problems with Set Solutions (Q2805755) (← links)
• Treatment of set order relations by means of a nonlinear scalarization functional: a full characterization (Q2836074) (← links)
• A Fenchel–Rockafellar duality theorem for set-valued optimization (Q3112501) (← links)
• Optimality Conditions for Weakly <i>ϵ</i>-Efficient Solutions of Vector Optimization Problems with Applications (Q4634185) (← links)
• An algorithm to solve polyhedral convex set optimization problems (Q4916312) (← links)
• Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization (Q4991680) (← links)
• A Benson-type algorithm for bounded convex vector optimization problems with vertex selection (Q5043850) (← links)
• Robust optimization revisited via robust vector Farkas lemmas (Q5277989) (← links)
• SET-VALUED SHORTFALL AND DIVERGENCE RISK MEASURES (Q5357511) (← links)
• Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)
• A polyhedral approximation algorithm for recession cones of spectrahedral shadows (Q6561494) (← links)
• On unbounded polyhedral convex set optimization problems (Q6621985) (← links)
• Existence of solutions for polyhedral convex set optimization problems (Q6632223) (← links)
• The natural ordering cone of a polyhedral convex set-valued objective mapping (Q6648849) (← links)