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

In linear programming, the objective function is the function that it is desired to maximize or minimize. The human interaction equivalent is what matters most. Agreement on that, and on the steps to ...

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

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

Results of this study raise serious questions concerning the reliability of a widely used commercial linear programming package. Three versions of IBM linear programming software were considered in ...