0% found this document useful (0 votes)
37 views2 pages

Or Assignment 2

Uploaded by

omsingh04122002
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
37 views2 pages

Or Assignment 2

Uploaded by

omsingh04122002
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Subject Name: OPERATION RESEARCH

Subject Number: MA30014


ASSIGNMENT 2

Q.1. Solve the L.P.P.


Maximize z = 5x1 + 2x2 + 2x3

subject to x1 + 2x2 − 2x3 ≤ 30


x1 + 3x2 + x3 ≤ 36
x1 , x2 , x3 ≥ 0.

Q.2. Solve the following L.P.P. by simplex method :

Minimize z = −3x1 + 2x2

subject to x1 − 4x2 ≤ −14


−3x1 + 2x2 ≤ 6
x1 , x2 ≥ 0.

Q.3. Solve the following L.P.P. by Big M-method :

Maximize z = 5x1 + 11x2

subject to 2x1 + x2 ≤ 4
3x1 + 4x2 ≥ 24
2x1 − 3x2 ≥ 6
x1 , x2 ≥ 0.

Q.4. Use simplex method to solve the following L.P.P.

Maximize z = 5x1 + 2x2

subject to 6x1 + 10x2 ≤ 30


10x1 + 4x2 ≤ 20
x1 , x2 ≥ 0.

Is the solution unique? If not, write down the convex combination of the alternative optima.

1
Q.5. Use the simplex method to solve the L.P.P.

Maximize z = 2x2 + x3

subject to x1 + x2 − 2x3 ≤ 7
−3x1 + x2 + 2x3 ≤ 3
x1 , x2 , x3 ≥ 0.

Q.6. Solve the L.P.P. by simplex method

Minimize z = x1 − 3x2 + 2x3

subject to 3x1 − x2 + 2x3 ≤ 7


−2x1 + 4x2 ≤ 12
−4x1 + 3x2 + 8x3 ≤ 10
x1 , x2 , x3 ≥ 0.

Q.7. Find xj ≥ 0, (j = 1, 2, 3, 4)

subject to x1 + 2x2 + 3x3 = 15


2x1 + x2 + 5x3 = 20
x1 + 2x2 + x3 + x4 = 10

which will maximize the function


x1 + 2x2 + 3x3 − x4 .

Q.8. Show that the following L.P.P. admits of an infinite number of solutions :

Maximize z = 4x1 + 14x2

subject to 2x1 + 7x2 ≤ 21


7x1 + 2x2 ≤ 21
x1 , x2 ≥ 0.

NOTE: Please submit the assignment in loose sheets

You might also like