Visualization of a Set of Pareto Optimal Decisions
Panos M. Pardalos,
Antanas Žilinskas and
Julius Žilinskas
Additional contact information
Panos M. Pardalos: University of Florida
Antanas Žilinskas: Vilnius University
Julius Žilinskas: Vilnius University
Chapter Chapter 9 in Non-Convex Multi-Objective Optimization, 2017, pp 139-145 from Springer
Abstract:
Abstract visualization Applications of optimization methods for optimal design are most efficient when combined with the human engineer’s insight. Visualization is a technique which makes it easier for an engineer to understand the design space and interpret a design found by an optimization algorithm [255]. There are many techniques aimed at visualization of Pareto optimal solutions, especially for the bi-objective problems where a set of solutions, usually referred to as a Pareto front, is a curve in a two-dimensional solution space. The problem of visualization of the sets of optimal decisions is researched not so thoroughly. However, the visualization of a set of Pareto optimal decisions can significantly aid the choice of an appropriate engineering design. In this chapter, we present a case study of a process optimization where the application of a visualization technique was very helpful in the analysis of appropriate design variables.
Date: 2017
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-61007-8_9
Ordering information: This item can be ordered from
http://www.springer.com/9783319610078
DOI: 10.1007/978-3-319-61007-8_9
Access Statistics for this chapter
More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().