Linear Programming — Short Notes

Meaning and scope

  • Linear programming optimizes a linear objective subject to linear constraints and non-negativity conditions.
  • Start by identifying the quantities, variables, units and required result in linear programming.

Key terms and notation

  • objective function, decision variables, constraints, feasible region, corner points.
  • Keep each symbol and base value explicit; distinguish a formula’s inputs from the quantity it calculates.

Method

  • Set out the known values and applicable relationship before substituting numbers.
  • Solve in a clear sequence, preserve units and verify the result with the original condition or equation.

Business application

  • A firm can allocate labour and materials across products to maximize contribution while respecting resource limits.
  • Interpret the numerical answer in the business context, including the relevant currency, period or quantity.

Checks and limitations

  • The optimum must lie in the feasible region; verify constraints and distinguish infeasible, unbounded and multiple-optimum cases.
  • Check assumptions, sign, magnitude, units and whether the answer is feasible for the business situation.