Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets

DOI10.1007/978-3-540-87477-5_26MaRDI QIDQ3627699zbMATH OpenOpenAlexFDO

Authors Bach Kim Nguyen Thi, Le Thi Hoai An, Minh Thanh Tran

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

zbMATH Keywords

increasing functionoptimization over the efficient setmultiple objective linear programmingpolyblock approximation algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29)

Recommendations

• Optimizing a linear function over an efficient set
• Reverse polyblock approximation for optimization over the weakly efficient set and efficient set.
• A method for optimizing over the integer efficient set
• Optimization over the efficient set of a bicriteria convex programming problem
• Bisection search algorithm for optimizing over the efficient set

Cites work

• scientific article; zbMATH DE number 1086738 (Why is no real title available?)
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
• An algorithm for optimizing over the efficient set
• An alogrithm for monotonic global optimization problems^∗
• Combination between global and local methods for solving an optimization problem over the efficient set
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Convex Analysis
• Normal sets, polyblocks, and monotonic optimization
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS
• Optimizing a linear function over an efficient set

Cited in

(4)

• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
• A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming
• Optimization over the efficient set of multiple objective discrete programs using the Edgeworth-Pareto hull in outcome space
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set

This page was built for publication: Outcome-Space Polyblock Approximation Algorithm for Optimizing over Efficient Sets

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