Assumptions and Limitations in Linear Programming

Assumptions and Limitations in Linear Programming

Assumptions and Limitations in Linear Programming

The following assumptions in Linear Programming may be true or valid over the area of search appropriate to the problems:

  1. There are a number of restrictions or constraints expressible in quantitative terms.
  2. The parameters are subject to variations in magnitude.
  3. The relationships expressed by constraints and the objective functions are linear.
  4. The objective function is to be optimized w.r.t. the variables involved in the phenomenon.
  5. The fundamental characteristics in all such cases is to find some optimum strategy under certain known specifications.

Limitations of Linear Programming

  1. The assumption that all relations are linear may not hold good in many real situations e.g. production cost may not be a linear function of output, in the case of variable costs the profit coefficients may not satisfy the linearity restriction.
  2. In L.P. all coefficients and constraints are stated with certainty.
  3. The solution many times is in rounding – off.
  4. When the number of variables or constraints involved in the phenomenon are quite large then it may become necessary to use computers.

 

Scroll to top
You cannot copy content of this page. The content on this website is NOT for redistribution