This paper describes the Criss-Cross Method of solving linear programming problems. The method, a primal-dual scheme, normally begins with a problem solution that is neither primal nor dual feasible, ...

Grade school math students are likely familiar with teachers admonishing them not to just guess the answer to a problem. But a new proof establishes that, in fact, the right kind of guessing is ...

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