Login / Signup

A method for finding the set of non-dominated vectors for multiple objective integer linear programs.

John SylvaAlejandro Crema
Published in: Eur. J. Oper. Res. (2004)
Keyphrases
  • linear program
  • linear programming
  • optimization algorithm
  • cost function
  • objective function
  • simplex method
  • linear inequalities
  • reference point
  • linear programming problems