Scribd
Upload
3 views1 page

Problem Sheet 3

Uploaded by

Ishika Goel
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
3 views1 page

Problem Sheet 3

Uploaded by

Ishika Goel
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

OPTIMIZATION I ( MAT-388)

Problem Sheet -3

1. Convert the following linear programming problem into the standard form and find
all it’s basic feasible solution
min z = 2x1 − x2 + 2x3
subject to
−x1 + x2 + x3 = 4
−x1 + x2 − x3 ≤ 6
x1 ≤ 0, x2 ≥ 0
x3 unrestricted in sign.
2. Consider the problem
max z = min(3x − 10, −5x + 5)
subject to
0 ≤ x ≤ 5.
(a) Solve the above problem graphically.
(b) Formulate the above as a LP in standard form.
3. Without sketching the graph find all the vertices of the set of feasible solutions of
−x1 + x2 ≤ 1
2x1 − x2 ≤ 2
x1 , x2 ≥ 0.

4. Solve the following LP without using the simplex method


max z = 4x1 + 5x2 + 11x3 + 2x4
subject to
21x1 + 7x2 − 3x3 + 10x4 = 210
xi ≥ 0, i = 1, 2, 3, 4 .

5. Consider an extreme point (x1 , x2 ) = (4, 0) of the feasible set of following LP problem
max −x1 + 2x2
subject to
3x1 + 4x2 = 12
2x1 − x2 ≤ 12
x1 , x2 ≥0

Check using simplex method whether this extreme point is optimal or not?

You might also like