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

Fromulation of LPP, A paper mill produces two grades of paper viz., X and ...

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 ot grade Y paper in

#transportation and linear models.., #what is the similarity and difference...

#what is the similarity and differences between transportation and linear programing models?

A paper mill produces, . A paper mill produces two grades of paper viz., X ...

. 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

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

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 models, In your own words, describe the special cases of...

In your own words, describe the special cases of integer programming and binary programming: what makes these problems different? Give an example of each, pointing out why they mus

CORE TECHNOLOGY TO WATCH IN FUTURE, AI TECHNOLOGY''S CURRENT AND POTENTIAL ...

AI TECHNOLOGY''S CURRENT AND POTENTIAL FUTURE APPLICATIONS

Linear programming, Solve the following Linear Programming Problem using Si...

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

Maths, Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

Maxz=3x1-2x2 St x1-x2 >_0, 3x1-x2 _0

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