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.
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback