A new form of 2-dimensional nim is investigated. Positions are rectangular matrices of non-negative integers. Moves consist of chosing a positive integer and a row or column and subtracting the integer from every element of the chosen row or column. Last to move wins. The 2 × 1 case is just Wythoff’s Game. The outcomes of all 2×2 positions are found in both the impartial and partizan cases. Som...

We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm, which has become the basis of all commercial computer codes for linear programming, simply recognizes that much of the information calculated by the simplex method at each iteration, as described in Chapter 2, is not needed. Thus, efficienci...