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

Cgj, application&techniques

application&techniques

C, classification on the bases of function or purpose

classification on the bases of function or purpose

Linear programming problem, #Solve the following Linear Programming Problem...

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

information on research done, Information on Research Done Informatio...

Information on Research Done Information on Doctoral research work already done  is available from  the followings  sources: a. Bibliography of Doctoral  Dissertations Acce

Ranganathan''s principles, Ranganathan's Principles: Perhaps it would ...

Ranganathan's Principles: Perhaps it would be worthwhile to consider the Five Laws of Library Science of Dr. S. R. Ranganathan as the basic guidelines for formulating the obje

Discuss the basic components of any queueing system, Question: (a) Disc...

Question: (a) Discuss briefly the four basic components of any queueing system. (b) Explain what you understand by the following models: (i) (M| M | 1 : N | FCFS) (ii

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

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

Scope, Scope of operations research

Scope of operations research

Pay-off matrix , In a rectangular game, pay-off matrix of player A is as fo...

In a rectangular game, pay-off matrix of player A is as follows: Player B B1 B2 Player A A1 A2 i) Solve the game. ii) Write down the pay-off matrix of B and th

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