Linear Programming



A linear program can be solved in centralized fashion by using either the simplex method or the interior point method (IPN).
Simplex approaches on the boundary of the objective function and tried to approach optimal point whereas IPN approaches from within the function range.
Comments