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

A regression study of the number of efficient extreme points in multiple objective linear programming

Author

Listed:
  • Steuer, Ralph E.
  • Piercy, Craig A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Steuer, Ralph E. & Piercy, Craig A., 2005. "A regression study of the number of efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 162(2), pages 484-496, April.
    • Handle: RePEc:eee:ejores:v:162:y:2005:i:2:p:484-496
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00699-4
    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. Stanley Zionts & Jyrki Wallenius, 1980. "Identifying Efficient Vectors: Some Theory and Computational Results," Operations Research, INFORMS, vol. 28(3-part-ii), pages 785-793, June.
    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. Gardiner, Lorraine R. & Steuer, Ralph E., 1994. "Unified interactive multiple objective programming," European Journal of Operational Research, Elsevier, vol. 74(3), pages 391-406, May.
    4. Pekka Korhonen & Seppo Salo & Ralph E. Steuer, 1997. "A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming," Operations Research, INFORMS, vol. 45(5), pages 751-757, October.
    5. Strijbosch, L.W.G. & van Doorne, A.G.M. & Selen, W.J., 1990. "A simplified MOLP algorithm : The MOLP-S procedure," Other publications TiSEM be36bc9e-0563-472f-ad4e-d, Tilburg University, School of Economics and Management.
    6. Minghe Sun & Ralph E. Steuer, 1996. "Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 367-375, November.
    7. Reeves, Gary R. & Reid, Randall C., 1988. "Minimum values over the efficient set in multiple objective decision making," European Journal of Operational Research, Elsevier, vol. 36(3), pages 334-338, September.
    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. Quariguasi Frota Neto, J. & Walther, G. & Bloemhof, J. & van Nunen, J.A.E.E. & Spengler, T., 2009. "A methodology for assessing eco-efficiency in logistics networks," European Journal of Operational Research, Elsevier, vol. 193(3), pages 670-682, March.
    2. Dehghanian, Farzad & Mansour, Saeed, 2009. "Designing sustainable recovery network of end-of-life products using genetic algorithm," Resources, Conservation & Recycling, Elsevier, vol. 53(10), pages 559-570.
    3. Hombach, Laura Elisabeth & Büsing, Christina & Walther, Grit, 2018. "Robust and sustainable supply chains under market uncertainties and different risk attitudes – A case study of the German biodiesel market," European Journal of Operational Research, Elsevier, vol. 269(1), pages 302-312.
    4. 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.
    5. Frota Neto, J. Quariguasi & Bloemhof-Ruwaard, J.M. & van Nunen, J.A.E.E. & van Heck, E., 2008. "Designing and evaluating sustainable logistics networks," International Journal of Production Economics, Elsevier, vol. 111(2), pages 195-208, February.
    6. J Quariguasi Frota Neto & L Angulo-Meza, 2007. "Alternative targets for data envelopment analysis through multi-objective linear programming: Rio de Janeiro Odontological Public Health System Case Study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 865-873, July.

    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. Alves, Maria João & Costa, João Paulo, 2009. "An exact method for computing the nadir values in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 198(2), pages 637-646, October.
    2. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    3. 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.
    4. Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
    5. Sun, Minghe, 2005. "Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures," European Journal of Operational Research, Elsevier, vol. 162(2), pages 468-483, April.
    6. Park, K. Sam & Shin, Dong Eun, 2012. "Interactive multiobjective optimization approach to the input–output design of opening new branches," European Journal of Operational Research, Elsevier, vol. 220(2), pages 530-538.
    7. Gallagher, Richard J. & Saleh, Ossama A., 1995. "A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program," European Journal of Operational Research, Elsevier, vol. 80(1), pages 204-212, January.
    8. Tu, Ta Van, 2000. "Optimization over the efficient set of a parametric multiple objective linear programming problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 570-583, May.
    9. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    10. J. Granat & M. Makowski, 1998. "ISAAP - Interactive Specification and Analysis of Aspiration-Based Preferences," Working Papers ir98052, International Institute for Applied Systems Analysis.
    11. P Vasant & R Nagarajan & S Yaacob, 2005. "Fuzzy linear programming with vague objective coefficients in an uncertain environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 597-603, May.
    12. 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.
    13. Mariano Luque & Rafael Caballero & Julian Molina & Francisco Ruiz, 2007. "Equivalent Information for Multiobjective Interactive Procedures," Management Science, INFORMS, vol. 53(1), pages 125-134, January.
    14. Steuer, Ralph E. & Utz, Sebastian, 2023. "Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing," European Journal of Operational Research, Elsevier, vol. 306(2), pages 742-753.
    15. J. Granat & M. Makowski, 1995. "SAP- Modular Tool for Specification and Analysis of User Preferences in Multiple-Criteria Model Analysis," Working Papers wp95073, International Institute for Applied Systems Analysis.
    16. Sun, Minghe, 2002. "A multiple objective programming approach for determining faculty salary equity adjustments," European Journal of Operational Research, Elsevier, vol. 138(2), pages 302-319, April.
    17. 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.
    18. Halme, Merja & Korhonen, Pekka & Eskelinen, Juha, 2014. "Non-convex value efficiency analysis and its application to bank branch sales evaluation," Omega, Elsevier, vol. 48(C), pages 10-18.
    19. 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.
    20. Sun, Minghe, 2011. "A primogenitary linked quad tree approach for solution storage and retrieval in heuristic binary optimization," European Journal of Operational Research, Elsevier, vol. 209(3), pages 228-240, March.

    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:162:y:2005:i:2:p:484-496. 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.