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

Linear Programming, A paper mill produces two grades of paper viz., X & Y. ...

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

Other determinants of sample size- sampling decisions, Other  Determinants ...

Other  Determinants  of Sample Size 1. The variability  of elements  within the population  has become  a  very  important  factor  to decide the  sample  size.    The more  v

Linear programming, A paper mill produces two grades of paper viz., X and Y...

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

Optimal assingment, words each) Q2. Six Operators are to be assigned to fiv...

words each) Q2. Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will ha

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Development of lp problems, A company manufactures 2 kinds of hats. Each ha...

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market re

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

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

Sequencing, how the sequencing techniques help the manager

how the sequencing techniques help the manager

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