TITLE

Interactive Polyhedral Outer Approximation (IPOA) strategy for general multiobjective optimization problems

AUTHOR(S)
Lazimy, Rafael
PUB. DATE
November 2013
SOURCE
Annals of Operations Research;Nov2013, Vol. 210 Issue 1, p73
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We propose an interactive polyhedral outer approximation (IPOA) method to solve a broad class of multiobjective optimization problems (MOP) with, possibly, nonlinear and nondifferentiable objective and constraint functions, and with continuous or discrete decision variables. During the interactive optimization phase, the method progressively constructs a polyhedral approximation of the decision-maker's (DM's) unknown preference structure and a polyhedral outer-approximation of the feasible set of MOP. The piecewise linear approximation of the DM's preferences also provides a mechanism for testing the consistency of the DM's assessments and removing inconsistencies; it also allows post-optimality analysis. All the feasible trial solutions are non-dominated ( efficient, or Pareto-optimal) so preference assessments are made in the context of non-dominated alternatives only. Upper and lower bounds on the yet unknown optimal value are produced at every iteration, allowing terminating the search prematurely at a good-enough solution and providing information about the closeness of this solution to the optimal solution. The IPOA method includes a preliminary phase in which a limited probe of the efficient set is conducted in order to find a good initial trial solution for the interactive phase. The computational requirements of the algorithm are relatively simple. The results of an extensive computational study are reported.
ACCESSION #
91696514

 

Related Articles

  • On generating maximal nondominated Benders cuts. Sherali, Hanif; Lunday, Brian // Annals of Operations Research;Nov2013, Vol. 210 Issue 1, p57 

    In this paper, we explore certain algorithmic strategies for accelerating the convergence of Benders decomposition method via the generation of maximal nondominated cuts. Based on interpreting the seminal work of Magnanti and Wong (Operations Research, 29(3), 464-484, ) for generating...

  • Comparing Solutions under Uncertainty in Multiobjective Optimization. Mlakar, Miha; Tušar, Tea; Filipič, Bogdan // Mathematical Problems in Engineering;2014, p1 

    Due to various reasons the solutions in real-world optimization problems cannot always be exactly evaluated but are sometimes represented with approximated values and confidence intervals. In order to address this issue, the comparison of solutions has to be done differently than for exactly...

  • Decision quality using ranked attribute weights. Hutton Barron, F.; Barrett, Bruce E. // Management Science;Nov96, Vol. 42 Issue 11, p1515 

    Three published approximation formulae for selecting the best multiattribute alternative based on rank-ordered weights are evaluated. All formulae are surprisingly efficacious in determining the best alternative. Rank order centroid (ROC) weights are more accurate than the other rank-based...

  • Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making. Karasakal, Esra; Köksalan, Murat // Operations Research;Jan/Feb2009, Vol. 57 Issue 1, p187 

    In this paper, we address the problem of generating a discrete representation of the nondominated frontier in multiple objective linear problems. We find a surface that approximates the shape of the nondominated frontier. Utilizing the surface, we generate a set of discrete points that is...

  • Multicriteria decision making under uncertainty. Novikova, Natalia M.; Pospelova, Irina I. // Mathematical Programming;2002, Vol. 92 Issue 3, p537 

    Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the...

  • Unbiased approximation in multicriteria optimization. Klamroth, Kathrin; Tind, Jørgen; Wiecek, Margaret M. // Mathematical Methods of Operations Research;2003, Vol. 56 Issue 3, p413 

    Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem...

  • ANALYTICAL EVALUATION OF MULTI-CRITERIA HEURISTICS. Daniels, Richard L. // Management Science;Apr92, Vol. 38 Issue 4, p501 

    This paper considers the problem of evaluating the solution quality of multi-criteria heuristics. By assuming an additive multi-attribute value structure, efficient and heuristic solutions can be translated into value measures that depend only on the relative importance assigned to the criteria...

  • A Multicriteria Strategic Decision Aid for Managers. Ebrahimi, Bahman P.; Grieu, Jean // International Journal of Management;Jun99, Vol. 16 Issue 2, p287 

    Focuses on a study on the multicriteria strategic decision aid similar to the voting process. Problems of strategic analysis; tion on multiple criteria decision making; Strategic indicators and multicriteria approach; Structure of the strategic information system.

  • Executive commentary. Higgs, A. Catherine // Academy of Management Executive;Aug95, Vol. 9 Issue 3, p43 

    The commentary refers to an article by McKinley, Sanchez and Schick about organizational influence and focuses on downsizing in the industrial-to-information evolution. The trend in automation and the baby boom generation in the workforce led to an oversupply of workers and a shift in the social...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics