The output consists of the optimal objective value, values for the decision variables, and the associated reduced costs. Also reported are the values of the slack variables and their shadow prices. Sensitivity analysis of the right-hand values as well as of the objective function coefficients are provided. This program solves the transportation problem, using the transportation simplex method. If the problem is unbalanced a dummy warehouse or dummy plant is added.
Initial solution is obtained by using the northwest corner method.
The program reports the intermediate solutions, presenting the cost as well as the quantities to be shipped for each route. This program solves the assignment problem. The solution method consists of the standard assignment algorithm. The program solves maximization and minimization problems. If the problem is unbalanced dummy candidates or dummy jobs are added.