Skip to main content
SpringerLink
Log in

Computationally Efficient Methods for Calculating the Ideal Solution for MOLP Problems

  • Technical Note
  • Published:
Journal of the Operational Research Society

Abstract

This paper presents the results of an investigation into computational considerations that are relevant to large-scale multiobjective linear programming (MOLP) problems. Four approaches to obtaining a representation of the ideal solution are compared. Statistics on the number of simplex iterations and CPU time required are analysed for a set of randomly generated multiobjective linear programming problems. Recommendations are made based on the analysis of these results which are applicable to many MOLP solution algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Management Sciences, Rider College, USA

    Cengiz Haksever

  2. Department of Operations and Strategic Management, Boston College, USA

    Jeffrey L. Ringuest

Authors
  1. Cengiz Haksever
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeffrey L. Ringuest
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Haksever, C., Ringuest, J. Computationally Efficient Methods for Calculating the Ideal Solution for MOLP Problems. J Oper Res Soc 43, 1179–1181 (1992). https://doi.org/10.1057/jors.1992.184

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.1992.184

Keywords

Search

Navigation