Linear Programming

History of linear programming goes back as far as 1940s. Main motivation for the need of linear programming goes back to the war time when they needed ways to solve many complex planning problems. The simplex method which is used to solve linear programming was developed by George B. Dantzig, in 1947. Dantzig, was one in who did a lot of work on linear programming, he was reconzied by several honours. Dantzig’s discovery was through …

…All types of problems can be solved that contain a linear function which is to be maximized or minimized and given the constraints. Solving any linear programming problem is very simple. • First step of is to find the equcation to be maximized or minimized. • Find all different constraints • Plot points on the graph and find the extreme points • Differentiate the feasiable set with the non-feasible set • Calculate solution using the extreme or the edge points