A solution method for arbitrary polyhedral convex set optimization problems
From MaRDI portal
Cites work
- A Representation Theorem for "Preference for Flexibility"
- A Vectorization Scheme for Nonconvex Set Optimization Problems
- An algorithm to solve polyhedral convex set optimization problems
- Calculus of convex polyhedra and polyhedral convex functions by utilizing a multiple objective linear programming solver
- Editorial. Choosing sets: preface to the special issue on set optimization and applications
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
- Existence of solutions for polyhedral convex set optimization problems
- scientific article; zbMATH DE number 3856810 (Why is no real title available?)
- scientific article; zbMATH DE number 1379225 (Why is no real title available?)
- Linear multiobjective programming
- Multicriteria Optimization
- Note: An algorithm to solve polyhedral convex set optimization problems
- On convex functions with values in conlinear spaces
- On unbounded polyhedral convex set optimization problems
- Set optimization and applications -- the state of the art. From set relations to set-valued risk measures
- Set-valued optimization. An introduction with applications
- Set-valued risk measures for conical market models
- Solution concepts in vector optimization: a fresh look at an old story
- Solving set-valued optimization problems using a multiobjective approach
- The Fundamental Theorem of Asset Pricing under Proportional Transaction Costs in Finite Discrete Time
- The natural ordering cone of a polyhedral convex set-valued objective mapping
- Vector Optimization with Infimum and Supremum
- Vector-valued coherent risk measures
- Vectorization in set optimization
This page was built for publication: A solution method for arbitrary polyhedral convex set optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7031293)
