The LP command is available to compute the solution to Linear Programming problems, which are characterized by an objective function of linear form with constraints that are linear.
In general, the format is:
LP c A B / options
The available options are:
||Saves the dual slack variables in the vector specified.
||Saves the dual solution in the vector specified.
||Prints information for SHAZAM consultants.
||Specifies the maximum number of iterations. The default is 15.
||Indicates that the problem is a MINimization problem.
||Saves the primal solution in the vector specified.
||Saves the primal slack variables in the vector specified.