Linear
 Programming
  What is LP?
  Handbook
  Solver
  2D Solver

Tools:
 Linear Programming

User's Handbook

• How to submit a general problem to the solver.
  
  
• How to use the two-dimensional graphical interface.
  
  

• First, you will be asked to enter the dimensions of your problem (dimension of the matrix, related to the number of constraints and variables in your problem).
  
• Then, you will have to enter the data (matrix A and vectors B and C).
  
• Then, you will have to select which method you want to use in order to solve your problem (Simplex method or Dual simplex method).
• Last, the program will return you the optimal value of the variables as well as the optimal value of the objective function (when the problem is feasible and has an optimal solution), and the computation time.
  

• If, when you enter the data of your problem, you leave some empty boxes in A, B or C, then the software will put some zeros in those empty boxes (default value).
  
• In case when the problem submited is infeasible, the program will returm a certificate of infeasibility.
  
• In case when the problem is unbounded, the program will return an unboundedness certificate.
  
• In case when the problem has an optimal solution, the program will return a certificate of optimality.

• First, you will be asked to enter the number of "greater than" inequalities, "smaller than" inequalities and equalities in the constraints.
• Then, you will be asked to enter the data (coefficients of your constraints and of the objective function).
• Last, the software will return you with:
  • The optimal solution.
  • The geometric representation (colored in red in the plan) of the feasible area that satisfies your constraints
  • The line representing your objective function, where all the points correspond to the same (optimal) value of the objective function (colored in green).
  • The point in the plan that represents the optimal solution (colored in yellow).