This paper presents three algorithms for solving linear programming problems in which some or all of the objective function coefficients are specified in terms of intervals. Which algorithm is ...
This is a preview. Log in through your library . Abstract Traditional sensitivity analysis of linear programming objective function coefficients concerns itself with variations in single parameters.
A routine written in IML to solve this problem follows. The approach appends slack, surplus, and artificial variables to the model where needed. It then solves phase 1 to find a primal feasible ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback