Provides a report on Linear programming which comprises of:

Solution Preview

Please see the attached file

Linear programming
Need:
Abstract
History
Need few solved problems

Bibilography and References taken.

Abstract
In mathematics, linear programming problems are optimization problems in which the objective function and the constraints are all linear. The model was developed during the second world war by a number of researchers. Linear programming is heavily used in many different fields, either to maximize the income or minimize the costs of a production scheme.

History
Linear programming was a mathematical model developed during the second world war to plan expenditures and returns such that it reduces costs to the army and increases losses to the enemy. It was kept secret until 1947. Postwar, many industries found its use in their daily planning.
The founders of the subject are George B. Dantzig, who published the simplex method in 1947, John von Neumann, who developed the theory of the duality in the same year, and Leonid Kantorovich, a Russian mathematician who used similar techniques in economics before Dantzig and won the Nobel prize in 1975 in economics. A breakthrough came after 1947 when Fiacco and McCormick introduced the Interior Point Method in 1984.
Dantzig's original example of finding the best assignment of 70 people to 70 jobs still explains its success. The computing power required to scan all the permutations to select the best ...