Note: An algorithm to solve polyhedral convex set optimization problems

DOI10.1080/02331934.2014.985680zbMATH Open1337.90059OpenAlexW2008729575MaRDI QIDQ2808332FDOQ2808332

Authors: Andreas Löhne, Carola Schrage 

Publication date: 23 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.985680

Recommendations

• An algorithm to solve polyhedral convex set optimization problems
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
• A note on the solution set in optimization with respect to cones
• An algorithm for solving the convex feasibility problem
• An algorithm for the convex feasibility problem
• On solution sets for convex optimization problems
• scientific article; zbMATH DE number 1271383
• scientific article; zbMATH DE number 4108510
• scientific article; zbMATH DE number 1497369
• Simplex-inspired algorithms for solving a class of convex programming problems

zbMATH Keywords

set-valued optimizationvector optimizationset relationset criterioninfimum attainment

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cites Work

• An algorithm to solve polyhedral convex set optimization problems

Cited In (3)

• On unbounded polyhedral convex set optimization problems
• An algorithm to solve polytopic set optimization problem based on a partial set order relation
• An algorithm to solve polyhedral convex set optimization problems

This page was built for publication: Note: An algorithm to solve polyhedral convex set optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808332)