IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v97y1998i1d10.1023_a1022614814789.html
   My bibliography  Save this article

Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming

Author

Listed:
  • H. P. Benson

    (Warrington College of Business Administration, University of Florida)

Abstract

Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple-objective linear programming problem (MOLP). Motivated by these difficulties, Benson recently developed a finite, outer-approximation algorithm for generating the set of all efficient extreme points in the outcome set, rather than in the decision set, of problem (MOLP). In this article, we show that the Benson algorithm also generates the set of all weakly efficient points in the outcome set of problem (MOLP). As a result, the usefulness of the algorithm as a decision aid in multiple objective linear programming is further enhanced.

Suggested Citation

  • H. P. Benson, 1998. "Further Analysis of an Outcome Set-Based Algorithm for Multiple-Objective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 97(1), pages 1-10, April.
    • Handle: RePEc:spr:joptap:v:97:y:1998:i:1:d:10.1023_a:1022614814789
    DOI: 10.1023/A:1022614814789
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1022614814789
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1022614814789?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. 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.
    2. Gerald W. Evans, 1984. "An Overview of Techniques for Solving Multiobjective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1268-1282, November.
    3. Harold P. Benson, 1985. "Multiple Objective Linear Programming with Parametric Criteria Coefficients," Management Science, INFORMS, vol. 31(4), pages 461-474, April.
    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. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    2. Henri Bonnel & Julien Collonge, 2015. "Optimization over the Pareto outcome set associated with a convex bi-objective optimization problem: theoretical results, deterministic algorithm and application to the stochastic case," Journal of Global Optimization, Springer, vol. 62(3), pages 481-505, July.
    3. Henri Bonnel & Julien Collonge, 2014. "Stochastic Optimization over a Pareto Set Associated with a Stochastic Multi-Objective Optimization Problem," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 405-427, August.
    4. 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.
    5. Löhne, Andreas & Weißing, Benjamin, 2017. "The vector linear program solver Bensolve – notes on theoretical background," European Journal of Operational Research, Elsevier, vol. 260(3), pages 807-813.
    6. Matthias Ehrgott & Andreas Löhne & Lizhen Shao, 2012. "A dual variant of Benson’s “outer approximation algorithm” for multiple objective linear programming," Journal of Global Optimization, Springer, vol. 52(4), pages 757-778, April.
    7. Zhenqiang Zhang & Sile Ma & Xiangyuan Jiang, 2022. "Research on Multi-Objective Multi-Robot Task Allocation by Lin–Kernighan–Helsgaun Guided Evolutionary Algorithms," Mathematics, MDPI, vol. 10(24), pages 1-17, December.

    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. 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.
    2. 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.
    3. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    4. Kaliszewski, Ignacy & Michalowski, Wojtek, 1999. "Searching for psychologically stable solutions of multiple criteria decision problems," European Journal of Operational Research, Elsevier, vol. 118(3), pages 549-562, November.
    5. Dranichak, Garrett M. & Wiecek, Margaret M., 2019. "On highly robust efficient solutions to uncertain multiobjective linear programs," European Journal of Operational Research, Elsevier, vol. 273(1), pages 20-30.
    6. Francisco J. André & Laura Riesgo, 2006. "A Duality Procedure to Elicit Nonlinear Multiattribute Utility Functions," Working Papers 06.02, Universidad Pablo de Olavide, Department of Economics.
    7. Daniel P. Loucks & László Somlyódy, 1986. "Multiobjective Assessment of Multipurpose Water Resources Projects for Developing Countries," Natural Resources Forum, Blackwell Publishing, vol. 10(1), pages 61-75, February.
    8. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    9. Aouni, Belaid & Kettani, Ossama, 2001. "Goal programming model: A glorious history and a promising future," European Journal of Operational Research, Elsevier, vol. 133(2), pages 225-231, January.
    10. 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.
    11. Kalu, Timothy Ch. U., 1999. "Capital budgeting under uncertainty: An extended goal programming approach," International Journal of Production Economics, Elsevier, vol. 58(3), pages 235-251, January.
    12. Lakshminarayan, P. G., 1993. "Tradeoffs in balancing multiple objectives of an integrated agricultural economic and environmental system," ISU General Staff Papers 1993010108000011833, Iowa State University, Department of Economics.
    13. Kalu, Timothy Ch. U., 1998. "Domestic petroleum-related expertise utilization and Nigeria's oil industry survival: A multicriteria decision analysis," European Journal of Operational Research, Elsevier, vol. 110(3), pages 457-473, November.
    14. Vetschera, Rudolf, 1992. "Estimating preference cones from discrete choices: Computational techniques and experiences," Discussion Papers, Series I 259, University of Konstanz, Department of Economics.
    15. 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.
    16. Gass, Saul I. & Roy, Pallabi Guha, 2003. "The compromise hypersphere for multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 144(3), pages 459-479, February.
    17. 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.
    18. Yasemin Aksoy, 1990. "An interactive branch‐and‐bound algorithm for bicriterion nonconvex/mixed integer programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(3), pages 403-417, June.
    19. Kalu, Timothy Ch. U., 1999. "An algorithm for systems welfare interactive goal programming modelling," European Journal of Operational Research, Elsevier, vol. 116(3), pages 508-529, August.
    20. Aloysius, John A. & Davis, Fred D. & Wilson, Darryl D. & Ross Taylor, A. & Kottemann, Jeffrey E., 2006. "User acceptance of multi-criteria decision support systems: The impact of preference elicitation techniques," European Journal of Operational Research, Elsevier, vol. 169(1), pages 273-285, February.

    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:joptap:v:97:y:1998:i:1:d:10.1023_a:1022614814789. 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.