Solve by simplex method, Operation Research

Assignment Help:

Solve by simplex method

  1. Maximize Z = 5x1 + 3x2

Subject to

3x1 + 5x2 ≤ 15

5x1 + 2x2 ≤ 10

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 235/19, x1= 20/19, x2= 45/19]

 

  1. Maximize Z = 5x1 + 7x2

Subject to

x1 + x2 ≤ 4

3x1 - 8x2 ≤ 24

10x1 + 7x2 ≤ 35

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 28, x1= 0, x2= 4]

 

 

 

 

  1. Maximize Z = 2x1 + 4x2 + x3+ x4

Subject to

x1 + 3x2 + x4 ≤ 4

2x1 + x2 ≤ 3

x2 + 4x3 + x4 ≤ 3

&         x1 ≥ 0, x≥ 0, x≥ 0, x≥ 0

[Ans. Max Z = 13/2, x1= 1, x2= 1, x3= 1/2, x4= 0]

 

  1. Maximize Z = 7x1 + 5x2

Subject to

-x1 - 2x2 -6

4x1 + 3x2 ≤ 12

&         x1 ≥ 0, x≥ 0

[Ans. Max Z = 21, x1= 3, x2= 0]

 

  1. Maximize Z = 3x1 + 2x2

Subject to

2x1 + x2 ≤ 10

x1 + 3x2 ≤ 6

x1 + x2 ≤ 21

&         x1 ≥ 0, x≥ 0


Related Discussions:- Solve by simplex method

Categories, what are the operation research?

what are the operation research?

Line balancing, what happen if line balancing does not exist

what happen if line balancing does not exist

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

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

A paper mill, A paper mill products two grade of paper viz., X & Y. Because...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Linear programming problem, A paper mill products two grade of paper viz., ...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Question, Solve the following Linear Programming Problem using Simple metho...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

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

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