A parametric programming approach to redefine the global configuration of resource constraints of 0-1-Integer Linear Programming problems.
Abstract: 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.
Keywords: Integer programming, Multiple objective programming, Parametric programming, Bottlenecks, Resource Constraints.
Category 1: Applications -- OR and Management Sciences
Category 2: Integer Programming ((Mixed) Integer Linear Programming )
Category 3: Other Topics (Multi-Criteria Optimization )
Citation: Escuela de Computación, Facultad de Ciencias, Universidad Central de Venezuela
Entry Submitted: 10/12/2016
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|