Scribd
Upload
63 views4 pages

MAN304T Operations Research Practice Problems1 Simplex

This document provides 10 practice problems on solving linear programming problems using the simplex method. For each problem, the objective function and constraints are defined. Solutions to some of the problems are provided after the problems are stated. The document concludes by wishing the reader best wishes from the Academic and Virtual Support Services Program.

Uploaded by

P Pujeth
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
63 views4 pages

MAN304T Operations Research Practice Problems1 Simplex

This document provides 10 practice problems on solving linear programming problems using the simplex method. For each problem, the objective function and constraints are defined. Solutions to some of the problems are provided after the problems are stated. The document concludes by wishing the reader best wishes from the Academic and Virtual Support Services Program.

Uploaded by

P Pujeth
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/ 4

MAN304T–Operations Research

Practice Problems on Linear Programming – Simplex Method

1. Solve the following by simplex method: x1 + 4 x2 + x3 ≤ 8


Maximize z = 3x1 + 5x2 + 6x3 2x1 + 2x3 ≤ 7
Subject to x1, x2, x3 ≥ 0.
2x1 + x2 + x3 ≤ 4
x1 + 2x2 + x3 ≤ 4 7. Maximize: z = 5x1 + 3x2 + 4x3
x1 + x2 + 2x3 ≤ 4 Subject to constraints:
x1≥ 0; x2 ≥ 0; x3 ≥ 0 2x1 + x2 + x3 ≤ 20
3x1 + x2 + 2x3 ≤ 30 ; x1, x2, x3 ≥ 0.
2. Solve by both simplex and graphical method:
Maximize z = 500x1 + 300x2 8. Maximize: z = 2x1 + 4x2 + 3x3
Subject to Subject to constraints:
15x1 + 5x2 ≤ 300 x1 + 3x2 + 2x3 ≤ 30
10x1 + 6x2 ≤ 240 x1 + x2 + x3 ≤ 24
8x1 + 12x2≤ 450 3x1 + 5 x2 +3x3 ≤ 60
x1, x2, x3 ≥ 0.
3. Solve by both simplex and graphical method:
Maximize z= x1 - x2 9. Maximize: z = 2x1 - x2 + x3
Subject to Subject to constraints:
-x1 + 3x2 ≤ 30 3x1 + x2 + x3 ≤ 6
-3x1 + x2 ≤ 30 x1 - x2 + 2x3 ≤ 1
x1, x2 ≥ 0 x1 + x2 - x3 ≤ 2
x1, x2, x3 ≥ 0.
4. Solve by simplex method
Maximize z = 10x1 + 15x2 + 20x3 10. Maximize: z = -x1 + x2 + 2x3
Subject to Subject to constraints:
x1 + 2x2 + 3x3 ≤ 12 x1 + 2x2 - x3 ≤ 20
x1 + 3x2 + 2x3 ≤ 10 -2x1 + 4x2 + 2x3 ≤ 60
x1≥ 0; x2 ≥ 0; x3 ≥ 0 2x1 + 3x2 + x3 ≤ 50
x1≥ 0; x2 ≥ 0 x1, x2, x3 ≥ 0.

5. Maximize: z = 2x1 + 3x2


Subject to constraints:
-3x1+x2 ≤ 1
4x1+2x2 ≤ 20
4x1 - x2 ≤ 10;
-x1 + 2x2 ≤ 5.
x1, x2 ≥ 0

6. Maximize: z = x1 + 2x2 + 4x3


Subject to constraints:
3x1 + x2 + 5x3 ≤ 10
Solutions to Class Assignment Problems

(1)
Optimal solution x1 = 0, x2 = x3 = 4/3. Optimal value is Z* = 44/3.

(4)

R1→ R1 + 20/3 R2; R2→ 1/3 R2; R3→ R3–2/3 R2;


Optimal point is x1 = 6, x2 = 0 and x3 = 2. Optimal value is Z* = 100.

BEST WISHES FROM THE DESK OF AVSSP

You might also like