Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Note: An algorithm to solve polyhedral convex set optimization problems

From MaRDI portal
Publication:2808332
Jump to:navigation, search

DOI10.1080/02331934.2014.985680zbMath1337.90059OpenAlexW2008729575MaRDI QIDQ2808332

Carola Schrage, Andreas Löhne

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


zbMATH Keywords

vector optimizationset-valued 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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2808332&oldid=15718484"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 18:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki