Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem.
Rajendra S. SolankiPublished in: Comput. Oper. Res. (1991)
Keyphrases
- linear program
- mixed integer
- bi objective
- linear programming
- linear programming problems
- convex hull
- set covering problem
- simplex method
- primal dual
- column generation
- multiple objectives
- continuous relaxation
- feasible solution
- np hard
- multi objective
- optimal solution
- objective function
- lot sizing
- search algorithm
- routing algorithm
- network design
- integer program
- cutting plane