Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems

Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems

0.00 Avg rating0 Votes
Article ID: iaor200937808
Country: Germany
Volume: 166
Issue: 1
Start Page Number: 271
End Page Number: 279
Publication Date: Feb 2009
Journal: Annals of Operations Research
Authors: ,
Abstract:

The paper describes new results in the field of multiobjective optimization techniques. The Interactive Decision Maps (IDM) technique is based on approximation of Feasible Criterion Set (FCS) and subsequent visualization of the Pareto frontier of FCS by interactive displaying the bi-criteria slices of FCS. The Estimation Refinement (ER) method is now the main method for approximating convex FCS in the framework of IDM. The properties of the ER method are studied. We prove that the number of facets of the approximation constructed by ER and the number of the support function calculations of an approximated set are asymptotically optimal. These results are important from the point of view of real-life applications of ER.

Reviews

Required fields are marked *. Your email address will not be published.