An algorithm for the multiple objective integer linear programming problem

https://doi.org/10.1016/0377-2217(82)90182-5Get rights and content

Abstract

A technique is presented for solving the multiple objective integer linear programming problem. The technique can be used to identify some or all efficient solutions. While the technique is applicable with any integer programming algorithm, it is well suited for implementation using integer postoptimality techniques. Such an implementation, based on Balas' Additive algorithm, is described for problems with zero-one variables.

References (26)

  • S. Holm et al.

    Discrete right hand side parametrization for linear integer programs

    European J. Operational Res.

    (1978)
  • P.L. Yu et al.

    The set of all nondominated solutions in linear cases and in multicriteria simplex method

    J. Math. Anal. Appl.

    (1975)
  • S. Zionts

    Integer linear programming with multiple objectives

    Ann. Discrete Math.

    (1977)
  • R.L. Banker et al.

    An algorithm for generating efficient solutions to the multiple objective integer programming problem

    (1978)
  • E. Balas

    An additive algorithm for solving linear programs with zero-one variables

    Operations Res.

    (1965)
  • G.R. Bitran

    Linear multiple objective programs with zero-one variables

    Math. Programming

    (1977)
  • G.R. Bitran

    Theory and algorithms for linear multiple objective programs with zero-one variables

    Math. Programming

    (1979)
  • J.G. Ecker et al.

    Finding efficient points for linear multiple objective programs

    Math. Programming

    (1975)
  • J.P. Evans et al.

    A revised simplex method for linear multiple objective programs

    Math. Programming

    (1973)
  • T. Gal et al.

    Multiparametric linear programming

    Management Sci.

    (1972)
  • R.S. Garfinkel et al.

    Integer Programming

    (1972)
  • A.M. Geoffrion et al.

    Parametric and postoptimal analysis in integer linear programming

    Management Sci.

    (1977)
  • E.L. Hannan

    Using duality theory for identification of primal efficient points and for sensitivity analysis in multiple objective linear programming

    J. Operational Res. Soc.

    (1978)
  • Cited by (103)

    • Optimization of a quadratic programming problem over an integer efficient set

      2024, Journal of Computational and Applied Mathematics
    • Branch-and-bound and objective branching with three or more objectives

      2022, Computers and Operations Research
      Citation Excerpt :

      This problem can be circumvented if the search procedure employs a “one-tree” search strategy where the method searches for efficient solutions in the decision space instead of searching for non-dominated outcomes in the objective space. One of the first Branch-and-Bound (B&B) based algorithms for multi-objective integer programming problems was developed by Klein and Hannan (1982). The algorithm uses post optimality techniques to solve a series of integer problems all in one tree structure.

    • A stochastic optimization model for staged hospital evacuation during hurricanes

      2021, Transportation Research Part E: Logistics and Transportation Review
    View all citing articles on Scopus
    View full text