Pages that link to "Item:Q4916312"
From MaRDI portal
The following pages link to An algorithm to solve polyhedral convex set optimization problems (Q4916312):
Displayed 13 items.
- Vectorization in set optimization (Q261980) (← links)
- Benson type algorithms for linear vector optimization and applications (Q743969) (← links)
- Solving set optimization problems based on the concept of null set (Q1728050) (← links)
- An algorithmic approach to multiobjective optimization with decision uncertainty (Q2173509) (← links)
- Lagrange duality in set optimization (Q2247892) (← links)
- A derivative-free descent method in set optimization (Q2340524) (← links)
- A recursive algorithm for multivariate risk measures and a set-valued Bellman's principle (Q2397431) (← links)
- Set Optimization—A Rather Short Introduction (Q2805754) (← links)
- A Survey of Set Optimization Problems with Set Solutions (Q2805755) (← links)
- Note: An algorithm to solve polyhedral convex set optimization problems (Q2808332) (← links)
- Set Relations via Families of Scalar Functions and Approximate Solutions in Set Optimization (Q4991680) (← links)
- A Vectorization Scheme for Nonconvex Set Optimization Problems (Q5081108) (← links)
- Solving set-valued optimization problems using a multiobjective approach (Q5882836) (← links)