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.

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 ...

The objective coefficient ranging analysis, discussed in the last example, is useful for accessing the effects of changing costs and returns on the optimal solution if each objective function ...

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...