SIMPLEX METHOD PRACTICE PROBLEM SET
Linear Programming Matrix: Maximization, Minimization & Mixed Constraints
General Instructions:
Formulate the initial simplex tableaus, execute the necessary pivoting iterations using the Gauss-Jordan row
operations, check for special cases (degeneracy, unboundedness, infeasibility), and find the optimal values for the
decision variables.
Part 1: Maximization Problems (Standard Form)
Instructions: Standardize by introducing slack variables (si ≥ 0) and maximize the objective function.
Problem 1 Problem 2
Maximize: Z = 3x1 + 5x2 Maximize: Z = 4x1 + 3x2 + 6x3
Subject to: Subject to:
x1 + 2x2 ≤ 10 2x1 + x2 + 3x3 ≤ 60
x1 + x2 ≤ 6 x1 + 2x2 + x3 ≤ 40
x 1, x 2 ≥ 0 x 1, x 2, x 3 ≥ 0
Problem 3 Problem 4
Maximize: Z = 2x1 + x2 + x3 Maximize: Z = 10x1 + 12x2 + 8x3
Subject to: Subject to:
x1 + x2 + 2x3 ≤ 20 2x1 + 2x2 + x3 ≤ 100
2x1 + x2 + x3 ≤ 30 x1 + 3x2 + 2x3 ≤ 120
x1 + 2x2 + x3 ≤ 40 3x1 + x2 + x3 ≤ 150
x 1, x 2, x 3 ≥ 0 x 1, x 2, x 3 ≥ 0
Linear Programming & Operations Research Page 1 of 4
Problem 5 (Case of Degeneracy)
Maximize: Z = 3x1 + 9x2
Subject to:
x1 + 4x2 ≤ 8
x1 + 2x2 ≤ 4
x 1, x 2 ≥ 0
Note: Watch for a tie in the minimum ratio test
during iterations.
Part 2: Minimization Problems
Instructions: Solve either by converting to maximization (Min W = -Max -W) using standard slack/surplus setups, or by
altering the optimality criteria row.
Problem 6 Problem 7
Minimize: W = 4x1 + x2 Minimize: W = 2x1 + 3x2
Subject to: Subject to:
3x1 + x2 ≥ 6 x1 + x2 ≥ 5
4x1 + 3x2 ≥ 12 x1 + 2x2 ≥ 6
x1 + 2x2 ≥ 4 x 1, x 2 ≥ 0
x 1, x 2 ≥ 0
Problem 8 Problem 9
Minimize: W = 3x1 + 5x2 + 2x3 Minimize: W = 7x1 + 5x2 + 6x3
Subject to: Subject to:
2x1 + x2 + x3 ≥ 10 x1 + x2 + x3 ≥ 30
x1 + 2x2 + 3x3 ≥ 15 2x1 + x2 + 3x3 ≥ 45
x 1, x 2, x 3 ≥ 0 x 1, x 2, x 3 ≥ 0
Linear Programming & Operations Research Page 2 of 4
Problem 10
Minimize: W = 8x1 + 10x2
Subject to:
4x1 + 2x2 ≥ 20
2x1 + 6x2 ≥ 24
x 1, x 2 ≥ 0
Part 3: Mixed Constraints (Big-M / Two-Phase Method)
Instructions: These structures contain mixed forms (≤, ≥, =). Introduce slack, surplus, and artificial variables where
required. Use the Big-M method or Two-Phase Simplex.
Problem 11 Problem 12
Maximize: Z = 2x1 + 3x2 + 5x3 Minimize: W = 4x1 + 2x2
Subject to: Subject to:
x1 + 2x2 + x3 ≤ 12 3x1 + x2 ≥ 27
2x1 + x2 + 3x3 ≥ 15 x1 + x2 = 21
x1 + x2 = 8 x1 + 2x2 ≤ 30
x 1, x 2, x 3 ≥ 0 x 1, x 2 ≥ 0
Problem 13 Problem 14 (Unboundedness Test)
Maximize: Z = 3x1 + 2x2 + 4x3 Maximize: Z = 4x1 + 3x2
Subject to: Subject to:
2x1 + x2 + 2x3 ≤ 18 x1 - x2 ≤ 10
x1 + 3x2 + x3 ≥ 10 2x1 ≤ 40
x1 + x2 + x3 = 12 x 1, x 2 ≥ 0
x 1, x 2, x 3 ≥ 0 Note: Identify the final layout where the leaving
variable cannot be determined due to non-
positive ratios.
Linear Programming & Operations Research Page 3 of 4
Problem 15 (Infeasibility Test)
Maximize: Z = 6x1 + 4x2
Subject to:
x1 + x2 ≤ 5
3x1 + 3x2 ≥ 21
x 1, x 2 ≥ 0
Note: Observe what happens when an artificial
variable remains basic with a non-zero value in
the final optimal iteration.
End of Problem Set. Practice layout for academic exams and advanced mathematical tracking.
Linear Programming & Operations Research Page 4 of 4