Optimization Online


A two-stage approach for bi-objective integer linear programming

Rui Dai(ruidai***at***mail.usf.edu)
Hadi Charkhgard(hcharkhgard***at***usf.edu)

Abstract: We present a new exact approach for solving bi-objective integer linear programs. The new approach efficiently employs two of the existing exact algorithms in the literature, including the balanced box and the epsilon-constraint methods, in two stages. A computationally study shows that (1) the new approach solves less single-objective integer linear programs in comparison to the balanced box method, and (2) it significantly improves the solution time in comparison to both the balanced box and the -constraint methods.

Keywords: two-stage approach, balanced box method, epsilon-constraint method, bi-objective integer

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )


Download: [PDF]

Entry Submitted: 04/14/2017
Entry Accepted: 04/14/2017
Entry Last Modified: 04/14/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society