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

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

C, classification on the bases of function or purpose

classification on the bases of function or purpose

TRANSPORATION PROBLEM, sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2...

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

SIMPLEX METHOD, Solve the following Linear Programming Problem using simple...

Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4

Important to theoretical distribution , Important to Theoretical Distributi...

Important to Theoretical Distribution The science  of theoretical distribution  under which  the frequencies of a variable are derived by  some  mathematical  model  without

Limitations of operational researchers, Among other limitations of O. R the...

Among other limitations of O. R the followings deserve mention: a. Basis: The operational researchers must be unbiased. An attempt to shoehorn result sin to a confirmation of ma

Replacement theory.., a pipe lis dur for rpair,the repair would cost 10000 ...

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

Linear programming simplex method, How to solve linear programming problems...

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Modi Method, a manufacture wants to ship 8 loads of his product as shown be...

a manufacture wants to ship 8 loads of his product as shown below. The matrix gives the mileage from origin to the destination D.

Sequencing problem, how do you use gantt chart for solving sequencing probl...

how do you use gantt chart for solving sequencing problem ? why is it not employed for solving larger problems?

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