Operations Research LP Solver description

Linear Programming (LP) is a mathematical modelling technique useful for allocation of limited resources such as material, machines etc to several competing activities such as projects, services etc. A typical linear programming problem consists of a linear objective function which is to be maximized or minimized subject to a finite number of linear constraints. (Wiki)

The application will do the following for now:
• v1.0 - 1.2
• Simplex (2 phase and Dual Simplex Included)
1. Minimization
2. Maximization

• More to come:
• IP (integer problems) Branch and bound
• Sensitivity Analysis
• Graphical Solution
• = Sign restrictions

Sign Restriction supported at the moment:
<= and >=

Potentially unlimited number of constraints to add!

The application works as follows, each LP equations is represented by either 2 key words "min" & "max" (min for minimization and max for maximization). Followed by the objective function variables with each of the variables separated by 1 space, at the end of each equation no need to add any spaces just a return is enough:

max 4 3 <- Obj
1 2 <= 40 <- Constraint 1
2 1 <= 60 <- Constraint 2

Another example with decimals.

min 15 10 20
0.10 0.20 0.67 >= 30
0.45 0.25 0.30 >= 40

Credits to: http://graphicloads.com/ For providing free icons!