Linear Programming

The idea of linear programming was developed in 1939 by Leonid Kantorovich which was used in the World Ward II. According to Boulding & Spivey (1960), the theory of the linear programming contains limits of field choice that is, however set by an appropriate number of linear inequalities. Linear equality is defined by Boulding & Spivery (1960) as being a special case which is bounded by conditions that subdivides itself into a position of either (a) possible or (b) feasible set consistent with the condition. Then also there is (c)impossible or (d) unattainable sets that are inconsistent with the condition. 

If the boundaries of the inequalities intersect at a point, then a choice is made. In the market force, a great deal of decision making is produced in order to attempt to maximize  but maximizing brings argument, judgement and trouble. Failing to maximize at decision making point, inhibits peculiarly characteristic of non traditional behavior  thus creating the marginal analysis. Between the marginal analysis, field points of decision creates a narrow gate for rational decision and fails to eliminate more possibility. 

Linear programming attempts to reduce the inequalities in order to utilize and maximize the a function. A linear relationship, between x and y can be expressed as x + by + c = 0, the relationship can be defined if the parameters of b and c is known. This technique, a traditional method, is mainly applied in order to determine a way to achieve the best outcome. The technique is utilized for engineering and optimizing a function objective.

References:Boulding, K. E.  & Spivey, A. (1960) Linear programming and the theory of the firm. The Macmillan Company, New York, USA.