Pages that link to "Item:Q2850733"
From MaRDI portal
The following pages link to Geometric duality for convex vector optimization problems (Q2850733):
Displaying 11 items.
- Primal and dual approximation algorithms for convex vector optimization problems (Q475807) (← links)
- Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
- Geometric consideration of duality in vector optimization (Q790718) (← links)
- Geometric programming and dual entropy-optimization problem (Q990605) (← links)
- Tractability of convex vector optimization problems in the sense of polyhedral approximations (Q1756800) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- Linear Vector Optimization and European Option Pricing Under Proportional Transaction Costs (Q2805756) (← links)
- Generalized duality and the geometry of linear programming (Q4836029) (← links)
- Multiobjective problems of convex geometry (Q5391623) (← links)
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems (Q5883318) (← links)
- Algorithms to Solve Unbounded Convex Vector Optimization Problems (Q6076862) (← links)