An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem |
scientific article; zbMATH DE number 1370761
| 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; zbMATH DE number 1370761 |
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
0.93377906
0 references
0.9103006
0 references
0.89422745
0 references
0.8904084
0 references
0.8875997
0 references
0.8752228
0 references
0.8716834
0 references
0.86465824
0 references
0.8641275
0 references
