Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets
From MaRDI portal
Publication:3627699
DOI10.1007/978-3-540-87477-5_26zbMath1160.90657OpenAlexW1888409732MaRDI QIDQ3627699
Hoai An Le Thi, Minh Thanh Tran, Bach Kim Nguyen Thi
Publication date: 13 May 2009
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87477-5_26
optimization over the efficient setincreasing functionmultiple objective linear programmingpolyblock approximation algorithm
Related Items (1)
Cites Work
- Unnamed Item
- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- Optimizing a linear function over an efficient set
- Normal sets, polyblocks, and monotonic optimization
- Combination between global and local methods for solving an optimization problem over the efficient set
- Numerical solution for optimization over the efficient set by d.c. optimization algorithms
- An alogrithm for monotonic global optimization problems∗
- ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
- Convex Analysis
- An algorithm for optimizing over the efficient set
This page was built for publication: Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets