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

A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program

Author

Listed:
  • Gallagher, Richard J.
  • Saleh, Ossama A.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:80:y:1995:i:1:p:204-212
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0247-U
    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. M. E. Dyer, 1983. "The Complexity of Vertex Enumeration Methods," Mathematics of Operations Research, INFORMS, vol. 8(3), pages 381-402, August.
    3. Gallagher, Richard J. & Saleh, Ossama A., 1994. "Constructing the set of efficient objective values in linear multiple objective transportation problems," European Journal of Operational Research, Elsevier, vol. 73(1), pages 150-163, February.
    4. 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.
    5. 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.
    6. T. H. Matheiss & David S. Rubin, 1980. "A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets," Mathematics of Operations Research, INFORMS, vol. 5(2), pages 167-185, May.
    7. White, D. J., 1991. "A characterisation of the feasible set of objective function vectors in linear multiple objective problems," European Journal of Operational Research, Elsevier, vol. 52(3), pages 361-366, June.
    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. 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.
    2. 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.
    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. 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. Ida, Masaaki, 2005. "Efficient solution generation for multiple objective linear programming based on extreme ray generation method," European Journal of Operational Research, Elsevier, vol. 160(1), pages 242-251, 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. 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.
    2. 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.
    3. Pey-Chun Chen & Pierre Hansen & Brigitte Jaumard & Hoang Tuy, 1998. "Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming," Operations Research, INFORMS, vol. 46(4), pages 548-562, August.
    4. 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.
    5. 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.
    6. 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.
    7. Maryam Bagherikahvarin & Yves Smet, 2017. "Determining new possible weight values in PROMETHEE: a procedure based on data envelopment analysis," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(5), pages 484-495, May.
    8. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    9. 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.
    10. repec:cep:stiecm:em/2012/559 is not listed on IDEAS
    11. N. Brauner & Y. Crama & A. Grigoriev & J. Klundert, 2005. "A Framework for the Complexity of High-Multiplicity Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 313-323, 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. 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.
    14. Li, Changmin & Yang, Hai & Zhu, Daoli & Meng, Qiang, 2012. "A global optimization method for continuous network design problems," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1144-1158.
    15. O Berman & Z Drezner, 2003. "A probabilistic one-centre location problem on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(8), pages 871-877, August.
    16. Tatiana Komarova, 2012. "Binary Choice Models with Discrete Regressors: Identification and Misspecification," STICERD - Econometrics Paper Series 559, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
    17. Liesiö, Juuso & Andelmin, Juho & Salo, Ahti, 2020. "Efficient allocation of resources to a portfolio of decision making units," European Journal of Operational Research, Elsevier, vol. 286(2), pages 619-636.
    18. Karakaya, G. & Köksalan, M. & Ahipaşaoğlu, S.D., 2018. "Interactive algorithms for a broad underlying family of preference functions," European Journal of Operational Research, Elsevier, vol. 265(1), pages 248-262.
    19. Haines, Linda M., 1998. "A statistical approach to the analytic hierarchy process with interval judgements. (I). Distributions on feasible regions," European Journal of Operational Research, Elsevier, vol. 110(1), pages 112-125, October.
    20. 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.
    21. 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.

    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:80:y:1995:i:1:p:204-212. 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.