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

Minimum effort approximation of the Pareto space of convex bi-criteria problems

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

DOI10.1023/A:1023993231971zbMath1118.90316OpenAlexW206766264MaRDI QIDQ1405558

Vincent Y. Blouin, Georges M. Fadel, Yusheng Li, Margaret M. Wiecek

Publication date: 25 August 2003

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023993231971


zbMATH Keywords

approximationPareto setbi-criteria optimizationhyper-ellipse


Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)


Related Items (3)

On the calculation of a membership function for the solution of a fuzzy linear optimization problem ⋮ Optimality conditions in nondifferentiable fuzzy optimization ⋮ Approximation methods in multiobjective programming


Uses Software

  • NBI



This page was built for publication: Minimum effort approximation of the Pareto space of convex bi-criteria problems

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