Solve lpp question graphically, Operation Research

Assignment Help:

A producer of furniture manufactures two products - tables and chairs. Processing of these products is done on two machines A and B. A chair needs 2 hours on machine A and 6 hours on machine B. A table needs 5 hours on machine A and no time on machine B. There are 16 hours of time per day accessible on machine A and 30 hours on machine B. Profit earned by the manufacturer from a chair and a table is Rs 2 and Rs 10 correspondingly. What must be the everyday production of each of two products?

Answer

Assume x1 indicates the number of chairs

Assume x2 indicates the number of tables

 

Chairs

Tables

Availability

Machine A

Machine B

2

6

5

0

16

30

Profit

Rs 2

Rs 10

 

 

LPP

Max Z = 2x1 + 10x2

Subject to

2x1+ 5x2 ≤ 16

            6x1 + 0x2 ≤ 30

 x1 ≥ 0 , x2 ≥ 0 

 

Solve graphically

The first constraint 2x1+ 5x2 ≤ 16, can be written in the form of equation

2x1+ 5x2 = 16

Place x1 = 0, then x2 = 16/5 = 3.2

Place x2 = 0, then x1 = 8

The coordinates are (0, 3.2) and (8, 0)

The second constraint 6x1 + 0x2 ≤ 30, can be written in the form of equation

6x1 = 30 → x1 =5

764_LPP Problems Solved Graphically.png

The corner positions of feasible region are A, B and C. So the coordinates for the corner positions are

A (0, 3.2)

B (5, 1.2) (Solve the two equations 2x1+ 5x2 = 16 and x1 =5 to obtain the coordinates)

C (5, 0)

 

We are given that Max Z = 2x1 + 10x2

At A (0, 3.2)

Z = 2(0) + 10(3.2) = 32

 

At B (5, 1.2)

Z = 2(5) + 10(1.2) = 22

 

At C (5, 0)

Z = 2(5) + 10(0) = 10

 

Max Z = 32 and x1 = 0, x2 = 3.2

The manufacturer must manufacture about 3 tables and no chairs to obtain the max profit.

 


Related Discussions:- Solve lpp question graphically

MB0048, A paper mill produces two grades of paper viz., X and Y. Because of...

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Linear programming, maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-...

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Sample linear programming problems to calculate max profit, The following l...

The following linear programming is written to plan the production of two products. And the company wants to maximize profits. x1 = number of product 1 produced in each batch

Dynamic programming, A company is planning its advertising strategy for the...

A company is planning its advertising strategy for the next year for its three major products.

requirements and characteristics of a good table , Requirements and Charac...

Requirements and Characteristics of a good table In the words  of Mr. Harry Jerome a good statistical table  is a triumph of ingenuity and  technique masterpiece of economy  o

Standara deviation - measure of dispersion , STANDARA DEVIATION Standa...

STANDARA DEVIATION Standard  deviation  is the  square  root of the  arithmetic  average of  squares of all  the deviations from the  mean. In short  it may  be defined  as th

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Describe states-transitions and transition rate, Customers arrive to a supe...

Customers arrive to a super market according to a Poisson process with intensity V = ½  per minute. The supermarket has two counters, that use a common queue. Counter 1 is always o

Rehearse - report writing presentation , Rehearse Making  presentat...

Rehearse Making  presentation is not  simple. It  is extremely  important  for us  to realize the sanctity of rehearsing  to improve the quality of the presentation. Unless

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd