AbstractComputer programs to solve linear programming problems by the simplex method have existed since the early 1950s. They remain the central feature of today's mathematical programming systems. There has been a steady increase in the size of problem that can be solved: this has been due as much to a better understanding of how to exploit sparseness as to larger and faster computers. There has been a steady increase in the type of problem that can be solved: this has been due as much to new concepts, such as separable programming, integer variables and special ordered sets, as to new algorithms. There has been a steady increase in the extent to which the application of mathematical programming has become more automatic. This applies both to the use of computerized matrix generators and report writers and to the mathematical formulation itself, in that we rely less on the user producing a well-scaled linear programming problem and are starting on the process of automatically sharpening the formulation of integer programming problems.Important new work is being done on all these aspects of computational mathematical programming.