The program is designed to solve the problems of integer, mixed-integer and noninteger programming.


The program provides the following methods:


1. M-Method

2. The two-stage method

3. The dual simplex method

4. The method of branches and borders

5. The method of clipping Gomory


M-method, a two-step method and dual simplex method designed to solve linear programming problems. In addressing the dual simplex method analyzes an optimal solution for sensitivity.


Branch and bound method and the method of clipping Gomory allow to solve completely integer and mixed-integer linear problems. When you receive the optimal solution analyzes the status of resources.

Do not forget to take into account the initial data "-" sign. And that will give not quite clear data.