IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v67y2017i3d10.1007_s10898-016-0426-4.html
   My bibliography  Save this article

Covers and approximations in multiobjective optimization

Author

Listed:
  • Daniel Vanderpooten

    (PSL, Université Paris Dauphine)

  • Lakmali Weerasena

    (Clemson University)

  • Margaret M. Wiecek

    (Clemson University)

Abstract

Due to the growing interest in approximation for multiobjective optimization problems (MOPs), a theoretical framework for defining and classifying sets representing or approximating solution sets for MOPs is developed. The concept of tolerance function is proposed as a tool for modeling representation quality. This notion leads to the extension of the traditional dominance relation to $$t\hbox {-}$$ t - dominance. Two types of sets representing the solution sets are defined: covers and approximations. Their properties are examined in a broader context of multiple solution sets, multiple cones, and multiple quality measures. Applications to complex MOPs are included.

Suggested Citation

  • Daniel Vanderpooten & Lakmali Weerasena & Margaret M. Wiecek, 2017. "Covers and approximations in multiobjective optimization," Journal of Global Optimization, Springer, vol. 67(3), pages 601-619, March.
    • Handle: RePEc:spr:jglopt:v:67:y:2017:i:3:d:10.1007_s10898-016-0426-4
    DOI: 10.1007/s10898-016-0426-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0426-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-016-0426-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Roy, B. & Figueira, J.R. & Almeida-Dias, J., 2014. "Discriminating thresholds as a tool to cope with imperfect knowledge in multiple criteria decision aiding: Theoretical results and practical issues," Omega, Elsevier, vol. 43(C), pages 9-20.
    2. Thomas Erlebach & Hans Kellerer & Ulrich Pferschy, 2002. "Approximating Multiobjective Knapsack Problems," Management Science, INFORMS, vol. 48(12), pages 1603-1612, December.
    3. B. Roy & Ph. Vincke, 1984. "Relational Systems of Preference with One or More Pseudo-Criteria: Some New Concepts and Results," Management Science, INFORMS, vol. 30(11), pages 1323-1335, November.
    4. JosÉ Figueira & Salvatore Greco & Matthias Ehrogott, 2005. "Multiple Criteria Decision Analysis: State of the Art Surveys," International Series in Operations Research and Management Science, Springer, number 978-0-387-23081-8, September.
    5. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2012. "PAINT: Pareto front interpolation for nonlinear multiobjective optimization," Computational Optimization and Applications, Springer, vol. 52(3), pages 845-867, July.
    6. Bazgan, Cristina & Hugot, Hadrien & Vanderpooten, Daniel, 2009. "Implementing an efficient fptas for the 0-1 multi-objective knapsack problem," European Journal of Operational Research, Elsevier, vol. 198(1), pages 47-56, October.
    7. A. Engau & M. M. Wiecek, 2007. "Cone Characterizations of Approximate Solutions in Real Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 499-513, September.
    8. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2011. "Constructing a Pareto front approximation for decision making," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 209-234, April.
    9. Arthur Warburton, 1987. "Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems," Operations Research, INFORMS, vol. 35(1), pages 70-79, February.
    10. Myung, Young-Soo & Kim, Hu-gon & Tcha, Dong-wan, 1997. "A bi-objective uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 100(3), pages 608-616, August.
    11. Gomez, T. & Gonzalez, M. & Luque, M. & Miguel, F. & Ruiz, F., 2001. "Multiple objectives decomposition-coordination methods for hierarchical organizations," European Journal of Operational Research, Elsevier, vol. 133(2), pages 323-341, January.
    12. Laumanns, Marco & Zenklusen, Rico, 2011. "Stochastic convergence of random search methods to fixed size Pareto front approximations," European Journal of Operational Research, Elsevier, vol. 213(2), pages 414-421, September.
    13. Goh, C. J. & Yang, X. Q., 1996. "Analytic efficient solution set for multi-criteria quadratic programs," European Journal of Operational Research, Elsevier, vol. 92(1), pages 166-181, July.
    14. Hunt, Brian J. & Wiecek, Margaret M. & Hughes, Colleen S., 2010. "Relative importance of criteria in multiobjective programming: A cone-based approach," European Journal of Operational Research, Elsevier, vol. 207(2), pages 936-945, December.
    15. S. Ruzika & M. M. Wiecek, 2005. "Approximation Methods in Multiobjective Programming," Journal of Optimization Theory and Applications, Springer, vol. 126(3), pages 473-501, September.
    16. Roman Efremov & Georgy Kamenev, 2009. "Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems," Annals of Operations Research, Springer, vol. 166(1), pages 271-279, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. I. Kaliszewski & J. Miroforidis, 2018. "On upper approximations of Pareto fronts," Journal of Global Optimization, Springer, vol. 72(3), pages 475-490, November.
    2. Lakmali Weerasena, 2022. "Advancing local search approximations for multiobjective combinatorial optimization problems," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 589-612, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bottero, M. & Ferretti, V. & Figueira, J.R. & Greco, S. & Roy, B., 2018. "On the Choquet multiple criteria preference aggregation model: Theoretical and practical insights from a real-world application," European Journal of Operational Research, Elsevier, vol. 271(1), pages 120-140.
    2. Kalyan Shankar Bhattacharjee & Hemant Kumar Singh & Tapabrata Ray, 2017. "An approach to generate comprehensive piecewise linear interpolation of pareto outcomes to aid decision making," Journal of Global Optimization, Springer, vol. 68(1), pages 71-93, May.
    3. Markus Hartikainen & Alberto Lovison, 2015. "PAINT–SiCon: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization," Journal of Global Optimization, Springer, vol. 62(2), pages 243-261, June.
    4. Engau, Alexander, 2009. "Tradeoff-based decomposition and decision-making in multiobjective programming," European Journal of Operational Research, Elsevier, vol. 199(3), pages 883-891, December.
    5. Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann, 2016. "On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach," Journal of Global Optimization, Springer, vol. 64(1), pages 3-16, January.
    6. Hartikainen, Markus & Miettinen, Kaisa & Klamroth, Kathrin, 2019. "Interactive Nonconvex Pareto Navigator for multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 275(1), pages 238-251.
    7. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2012. "PAINT: Pareto front interpolation for nonlinear multiobjective optimization," Computational Optimization and Applications, Springer, vol. 52(3), pages 845-867, July.
    8. Arne Herzel & Stefan Ruzika & Clemens Thielen, 2021. "Approximation Methods for Multiobjective Optimization Problems: A Survey," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1284-1299, October.
    9. Alexander Engau & Margaret M. Wiecek, 2008. "Interactive Coordination of Objective Decompositions in Multiobjective Programming," Management Science, INFORMS, vol. 54(7), pages 1350-1363, July.
    10. Bottero, M. & Ferretti, V. & Figueira, J.R. & Greco, S. & Roy, B., 2015. "Dealing with a multiple criteria environmental problem with interaction effects between criteria through an extension of the Electre III method," European Journal of Operational Research, Elsevier, vol. 245(3), pages 837-850.
    11. Govindan, Kannan & Jepsen, Martin Brandt, 2016. "ELECTRE: A comprehensive literature review on methodologies and applications," European Journal of Operational Research, Elsevier, vol. 250(1), pages 1-29.
    12. Rennen, G. & van Dam, E.R. & den Hertog, D., 2009. "Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets," Other publications TiSEM e2255959-6691-4ef1-88a4-5, Tilburg University, School of Economics and Management.
    13. Mavrotas, George & Figueira, José Rui & Siskos, Eleftherios, 2015. "Robustness analysis methodology for multi-objective combinatorial optimization problems and application to project selection," Omega, Elsevier, vol. 52(C), pages 142-155.
    14. Notte, Gastón & Cancela, Héctor & Pedemonte, Martín & Chilibroste, Pablo & Rossing, Walter & Groot, Jeroen C.J., 2020. "A multi-objective optimization model for dairy feeding management," Agricultural Systems, Elsevier, vol. 183(C).
    15. Pelissari, Renata & Oliveira, Maria Célia & Ben Amor, Sarah & Abackerli, Alvaro José, 2019. "A new FlowSort-based method to deal with information imperfections in sorting decision-making problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 235-246.
    16. Andreas Löhne & Birgit Rudloff & Firdevs Ulus, 2014. "Primal and dual approximation algorithms for convex vector optimization problems," Journal of Global Optimization, Springer, vol. 60(4), pages 713-736, December.
    17. José Figueira & Luís Paquete & Marco Simões & Daniel Vanderpooten, 2013. "Algorithmic improvements on dynamic programming for the bi-objective {0,1} knapsack problem," Computational Optimization and Applications, Springer, vol. 56(1), pages 97-111, September.
    18. Nguyen, Trung H. & Granger, Julien & Pandya, Deval & Paustian, Keith, 2019. "High-resolution multi-objective optimization of feedstock landscape design for hybrid first and second generation biorefineries," Applied Energy, Elsevier, vol. 238(C), pages 1484-1496.
    19. Soghra Nobakhtian & Narjes Shafiei, 2017. "A Benson type algorithm for nonconvex multiobjective programming problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 271-287, July.
    20. Markus Hartikainen & Kaisa Miettinen & Margaret Wiecek, 2011. "Constructing a Pareto front approximation for decision making," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 73(2), pages 209-234, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:67:y:2017:i:3:d:10.1007_s10898-016-0426-4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.