IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v65y2018i3p203-217.html
   My bibliography  Save this article

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

Author

Listed:
  • G. Tohidi
  • H. Hassasi

Abstract

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.

Suggested Citation

  • G. Tohidi & H. Hassasi, 2018. "Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(3), pages 203-217, April.
  • Handle: RePEc:wly:navres:v:65:y:2018:i:3:p:203-217
    DOI: 10.1002/nav.21805
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21805
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21805?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
    ---><---

    References listed on IDEAS

    as
    1. Leschine, Thomas M. & Wallenius, Hannele & Verdini, William A., 1992. "Interactive multiobjective analysis and assimilative capacity-based ocean disposal decisions," European Journal of Operational Research, Elsevier, vol. 56(2), pages 278-289, January.
    2. Gal, Tomas, 1977. "A general method for determining the set of all efficient solutions to a linear vectormaximum problem," European Journal of Operational Research, Elsevier, vol. 1(5), pages 307-322, September.
    3. Gravel, Marc & Martel, Jean Marc & Nadeau, Raymond & Price, Wilson & Tremblay, Richard, 1992. "A multicriterion view of optimal resource allocation in job-shop production," European Journal of Operational Research, Elsevier, vol. 61(1-2), pages 230-244, August.
    4. Harold P. Benson & Serpil Sayin, 1997. "Towards finding global representations of the efficient set in multiple objective mathematical programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 47-67, 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. Zachary Feinstein & Niklas Hey & Birgit Rudloff, 2023. "Approximating the set of Nash equilibria for convex games," Papers 2310.04176, arXiv.org, revised Apr 2024.

    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. G. Cocchi & M. Lapucci, 2020. "An augmented Lagrangian algorithm for multi-objective optimization," Computational Optimization and Applications, Springer, vol. 77(1), pages 29-56, September.
    2. Harold P. Benson & Serpil Sayin, 1997. "Towards finding global representations of the efficient set in multiple objective mathematical programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(1), pages 47-67, February.
    3. Qingjie Hu & Ruyun Li & Yanyan Zhang & Zhibin Zhu, 2024. "On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(1), pages 810-843, October.
    4. N. Mahdavi-Amiri & F. Salehi Sadaghiani, 2017. "Strictly feasible solutions and strict complementarity in multiple objective linear optimization," 4OR, Springer, vol. 15(3), pages 303-326, September.
    5. Ellen H. Fukuda & L. M. Graña Drummond & Fernanda M. P. Raupp, 2016. "An external penalty-type method for multicriteria," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 493-513, July.
    6. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    7. H. P. Benson & E. Sun, 2000. "Outcome Space Partition of the Weight Set in Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 17-36, April.
    8. Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
    9. Hokkanen, Joonas & Salminen, Pekka, 1997. "Choosing a solid waste management system using multicriteria decision analysis," European Journal of Operational Research, Elsevier, vol. 98(1), pages 19-36, April.
    10. Sylva, John & Crema, Alejandro, 2007. "A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1011-1027, August.
    11. S. Razavyan, 2016. "A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(04), pages 1-23, August.
    12. Serpil Sayin, 2003. "A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors," Operations Research, INFORMS, vol. 51(3), pages 427-436, June.
    13. Arevalo Quijada, Mª Teresa & Zapata Reina, Asunción, 1996. "La programación fraccionada múltiple: tratamiento del problema de la producción," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 6, pages 5-24, Diciembre.
    14. Ellen Fukuda & L. Graña Drummond, 2013. "Inexact projected gradient method for vector optimization," Computational Optimization and Applications, Springer, vol. 54(3), pages 473-493, April.
    15. Strijbosch, L.W.G. & van Doorne, A.G.M. & Selen, W.J., 1990. "A simplified MOLP algorithm : The MOLP-S procedure," Research Memorandum FEW 460, Tilburg University, School of Economics and Management.
    16. H. P. Benson, 1998. "Hybrid Approach for Solving Multiple-Objective Linear Programs in Outcome Space," Journal of Optimization Theory and Applications, Springer, vol. 98(1), pages 17-35, July.
    17. Trentesaux, Damien & Moray, Neville & Tahon, Christian, 1998. "Integration of the human operator into responsive discrete production management systems," European Journal of Operational Research, Elsevier, vol. 109(2), pages 342-361, September.
    18. Kuan-Min Lin & Matthias Ehrgott & Andrea Raith, 2017. "Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes," 4OR, Springer, vol. 15(4), pages 331-357, December.
    19. Dauer, Jerald P. & Gallagher, Richard J., 1996. "A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 88(2), pages 368-381, January.
    20. Katrin Teichert & Tobias Seidel & Philipp Süss, 2024. "Combining discrete and continuous information for multi-criteria optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 153-173, August.

    More about this item

    Statistics

    Access and download statistics

    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:wly:navres:v:65:y:2018:i:3:p:203-217. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.