An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem |
scientific article |
Statements
An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (English)
0 references
20 August 2000
0 references
The author investigates the value function of a linear program in 0-1 variables whose right hand side depends linearly on a parameter \(t\), \(0 \leq t \leq 1\). He reduces this problem to solving finitely many mixed-integer linear programs. The algorithm is computationally tested by multiconstrained knapsack problems.
0 references
0-1 linear programming
0 references
parametric programming
0 references
0 references
0 references
