ABSTRACT
One of the mathematical or Operations Research models that is applied to production and allocations is linear programming in which the variables are linearly related. This process of translation is called formulation. This chapter allows us to learn how to formulate the Linear Programming Problem. A maximisation type of objective function is set if the data reveals the profits in the problem. The production, sales, revenue, output etc., are to be maximised. A minimisation type of objective function is set if the data problem is given in terms of costs. The resources (and their utilisation) are to be minimised. The time utilised at given cost, loss, wastage, shortage, spoilage, costs etc., are some other terms where one thinks of minimisation. The different types of constraints one comes across in linear programming problem are given: Availability Constraint; Requirement Constraint; and Exact Constraint.
