Subject Operations Research
Assignment MB0048 – Set 1
Q.1. (a) what is linear programming problem?
(b) A toy company manufactures two types of dolls, a basic version doll- A and a deluxe version doll-B. Each doll of type B takes twice as long to produce as one of type A, and the company would have time to make maximum of 1000 per day. The supply of plastic is sufficient to produce 1000 dolls per day (both A & B combined). The deluxe version requires a fancy dress of which there are only 500 per day available. If the company makes a profit of Rs 3.00 and Rs 5.per doll, respectively on doll A and B, then how many of each doll should be produced per day in order to maximise the total profit. Formulate this problem.
(a): A linear program (LP) is a minimization problem where we are asked to minimize a given linear Function subject to one or more linear inequality constraints. The linear function is also called the objective function.
(b):
Formulation maximize z =3x1 +5x2
Constraints x1+2x2<=2000
X1+x2<=1500
X2<=600
X1,x2>=0
[x1=1000,x2=500,max z= 5500]
What are the advantages of Linear programming techniques? 1. The linear programming technique helps to make the best possible use of available productive resources (such as time, labor, machines etc.) 2. It improves the quality of decisions. The individual who makes use of linear programming methods becomes more objective than subjective.
3. It also helps in providing better tools for adjustment to meet changing conditions.
4. In a production process, bottle necks may occur. For example, in a factory some machines may be in great demand while others may lie idle for some time. A significant advantage of linear programming is highlighting of such bottle necks.
5. Most business problems involve constraints like raw materials availability, market demand etc. which must be taken into consideration. Just we can produce so