A mathematical programming approach to deal with the global configuration of resource constraints is presented. A specialized parametric programming algorithm to obtain the pareto set for the biobjective problem that appears to deal with the global configuration for 0-1-Integer Linear Programing problems is presented and implemented. Computational results for Multiconstrained Knapsack problems and Bounded Knapsack problems are presented.
Escuela de Computación, Facultad de Ciencias, Universidad Central de Venezuela
View A parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems.