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

A general method for determining the set of all efficient solutions to a linear vectormaximum problem

Author

Listed:
  • Gal, Tomas

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:1:y:1977:i:5:p:307-322
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(77)90063-7
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
    3. Wierzbicki, Andrzej P. & Granat, Janusz, 1999. "Multi-objective modeling for engineering applications: DIDASN++ system," European Journal of Operational Research, Elsevier, vol. 113(2), pages 374-389, March.
    4. 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.
    5. Schweigert, D. & Neumayer, P., 1997. "A reduction algorithm for integer multiple objective linear programs," European Journal of Operational Research, Elsevier, vol. 99(2), pages 459-462, June.
    6. Abdelaziz, F. Ben & Lang, P. & Nadeau, R., 1995. "Distributional efficiency in multiobjective stochastic linear programming," European Journal of Operational Research, Elsevier, vol. 85(2), pages 399-415, September.
    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. 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.
    9. 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.
    10. 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.
    11. Hanne, Thomas, 1999. "On the convergence of multiobjective evolutionary algorithms," European Journal of Operational Research, Elsevier, vol. 117(3), pages 553-564, September.
    12. 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.
    13. 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.
    14. 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.
    15. A.P. Wierzbicki, 1993. "Augmented Simplex: A Modified and Parallel Version of Simplex Method Based on Multiple Objective and Subdifferential Optimization Approach," Working Papers wp93059, International Institute for Applied Systems Analysis.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.
    21. Eusébio, Augusto & Figueira, José Rui, 2009. "On the computation of all supported efficient solutions in multi-objective integer network flow problems," European Journal of Operational Research, Elsevier, vol. 199(1), pages 68-76, November.

    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:1:y:1977:i:5:p:307-322. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.