IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v139y2002i1p26-41.html
   My bibliography  Save this article

A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program

Author

Listed:
  • Benson, Harold P.
  • Sun, Erjiang

Abstract

No abstract is available for this item.

Suggested Citation

  • Benson, Harold P. & Sun, Erjiang, 2002. "A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program," European Journal of Operational Research, Elsevier, vol. 139(1), pages 26-41, May.
    • Handle: RePEc:eee:ejores:v:139:y:2002:i:1:p:26-41
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(01)00153-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Dauer, J. P. & Saleh, O. A., 1990. "Constructing the set of efficient objective values in multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 46(3), pages 358-365, June.
    2. Tomas Gal & Josef Nedoma, 1972. "Multiparametric Linear Programming," Management Science, INFORMS, vol. 18(7), pages 406-422, March.
    3. Dauer, Jerald P. & Liu, Yi-Hsin, 1990. "Solving multiple objective linear programs in objective space," European Journal of Operational Research, Elsevier, vol. 46(3), pages 350-357, June.
    4. GAL, Thomas & NEDOMA, Jozef, 1972. "Multiparametric linear programming," LIDAM Reprints CORE 115, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    5. Korhonen, Pekka & Moskowitz, Herbert & Wallenius, Jyrki, 1992. "Multiple criteria decision support - A review," European Journal of Operational Research, Elsevier, vol. 63(3), pages 361-375, December.
    6. 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.
    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. Gerald W. Evans, 1984. "An Overview of Techniques for Solving Multiobjective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1268-1282, November.
    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. Melih Ozlen & Benjamin A. Burton & Cameron A. G. MacRae, 2014. "Multi-Objective Integer Programming: An Improved Recursive Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 470-482, February.
    2. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    3. Britta Schulze & Kathrin Klamroth & Michael Stiglmayr, 2019. "Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions," Journal of Global Optimization, Springer, vol. 74(3), pages 495-522, July.
    4. Sebastian Sitarz, 2010. "Standard sensitivity analysis and additive tolerance approach in MOLP," Annals of Operations Research, Springer, vol. 181(1), pages 219-232, December.
    5. Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
    6. Stephan Helfrich & Tyler Perini & Pascal Halffmann & Natashia Boland & Stefan Ruzika, 2023. "Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems," Journal of Global Optimization, Springer, vol. 86(2), pages 417-440, June.
    7. Alves, Maria João & Costa, João Paulo, 2016. "Graphical exploration of the weight space in three-objective mixed integer linear programs," European Journal of Operational Research, Elsevier, vol. 248(1), pages 72-83.
    8. 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.
    9. Özgür Özpeynirci & Murat Köksalan, 2010. "An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs," Management Science, INFORMS, vol. 56(12), pages 2302-2315, December.
    10. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.

    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. 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. 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.
    4. J. Fülöp & L. D. Muu, 2000. "Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 37-54, April.
    5. Filippi, Carlo & Romanin-Jacur, Giorgio, 2002. "Multiparametric demand transportation problem," European Journal of Operational Research, Elsevier, vol. 139(2), pages 206-219, June.
    6. Goldlücke, Susanne & Kranz, Sebastian, 2012. "Infinitely repeated games with public monitoring and monetary transfers," Journal of Economic Theory, Elsevier, vol. 147(3), pages 1191-1221.
    7. Amir Akbari & Paul I. Barton, 2018. "An Improved Multi-parametric Programming Algorithm for Flux Balance Analysis of Metabolic Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 502-537, August.
    8. Richard Oberdieck & Martina Wittmann-Hohlbein & Efstratios Pistikopoulos, 2014. "A branch and bound method for the solution of multiparametric mixed integer linear programming problems," Journal of Global Optimization, Springer, vol. 59(2), pages 527-543, July.
    9. C. Filippi, 2004. "An Algorithm for Approximate Multiparametric Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 120(1), pages 73-95, January.
    10. Efstratios Pistikopoulos & Luis Dominguez & Christos Panos & Konstantinos Kouramas & Altannar Chinchuluun, 2012. "Theoretical and algorithmic advances in multi-parametric programming and control," Computational Management Science, Springer, vol. 9(2), pages 183-203, May.
    11. Ilbin Lee & Stewart Curry & Nicoleta Serban, 2019. "Solving Large Batches of Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(2), pages 302-317, April.
    12. Frauendorfer, K. & Konigsperger, E., 1996. "Concepts for improving scheduling decisions: An application in the chemical industry," International Journal of Production Economics, Elsevier, vol. 46(1), pages 27-38, December.
    13. Fabian J. Sting & Arnd Huchzermeier, 2012. "Dual sourcing: Responsive hedging against correlated supply and demand uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 69-89, February.
    14. Zhang, Weihua & Reimann, Marc, 2014. "A simple augmented ∊-constraint method for multi-objective mathematical integer programming problems," European Journal of Operational Research, Elsevier, vol. 234(1), pages 15-24.
    15. 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.
    16. Jacinto Martín & Concha Bielza & David Ríos Insua, 2005. "Approximating nondominated sets in continuous multiobjective optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 469-480, August.
    17. Patrice Gaillardetz & Saeb Hachem, 2019. "Risk-Control Strategies," Papers 1908.02228, arXiv.org.
    18. J. Spjøtvold & P. Tøndel & T. A. Johansen, 2007. "Continuous Selection and Unique Polyhedral Representation of Solutions to Convex Parametric Quadratic Programs," Journal of Optimization Theory and Applications, Springer, vol. 134(2), pages 177-189, August.
    19. Iosif Pappas & Nikolaos A. Diangelakis & Efstratios N. Pistikopoulos, 2021. "The exact solution of multiparametric quadratically constrained quadratic programming problems," Journal of Global Optimization, Springer, vol. 79(1), pages 59-85, January.
    20. Stephan Helfrich & Arne Herzel & Stefan Ruzika & Clemens Thielen, 2022. "An approximation algorithm for a general class of multi-parametric optimization problems," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 1459-1494, October.

    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:eee:ejores:v:139:y:2002:i:1:p:26-41. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.