pulp_test, a Python code which uses the pulp() library to set up and solve a variety of linear programming problems including a simple simplex problem, a blending problem, a set partitioning problem, a Sudoku, and a transportation problem. Most of these examples are derived from the pulp() documentation, by Antony Phillips, Stuart Mitchell.
A typical linear programming problem might involve an mxn matrix A, an m-vector b, forming a linear inequality A*x<=b, with an unknown n-vector x, as well as a set of several equality constraints cons(x) and an objective function obj(x) to be optimized.
The information on this web page is distributed under the MIT license.
pulp_test is available in a Python version.