Generalized average shadow prices and bottlenecks

We present a generalization of the average shadow price in 0-1-Mixed Integer Linear Programming problems and its relation with bottlenecks including the analysis relative to the coefficients matrix of resource constraints. A mathematical programming approach to find the strategy for investment in resources is presented. Citation Escuela de ComputaciĆ³n, Facultad de Ciencias, Universidad Central de … Read more

A parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems.

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 … Read more