Scribd
Upload
31 views

Assignment 4 - The Simplex Method

The document outlines a series of linear programming problems to be solved using the simplex method, including both maximization and minimization scenarios. It provides specific constraints and objectives for each problem, along with final answers for some of the models. The results indicate various outcomes such as bounded solutions, infeasibility, and unbounded solutions.

Uploaded by

doaa atef
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
31 views

Assignment 4 - The Simplex Method

The document outlines a series of linear programming problems to be solved using the simplex method, including both maximization and minimization scenarios. It provides specific constraints and objectives for each problem, along with final answers for some of the models. The results indicate various outcomes such as bounded solutions, infeasibility, and unbounded solutions.

Uploaded by

doaa atef
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

Alexandria University Level One

Faculty of Engineering Fall Semester


Production Engineering Department Operations Research 2023

3 – The Simplex Method


1. Solve the following linear programming model using the simplex method:

Maximize z = 4X1 + 3X2


Subject to:
X1 + 2X2 < 4
2X1 + X2 > 6
X2 < 1
X1 & X2 > 0

2. Solve the following linear programming model using the simplex method:

Maximize z = 2X1 + 3X2


Subject to:
X1 + X2 > 3
X1 - 2X2 < 4
X1, X2 > 0
Practice Problems
3. Solve the following linear programming model using the simplex method:

Maximize z = 2X1 + X2
Subject to:
X1 + X2 < 1
X1 + 2X2 > 4
X1, X2 > 0

4. Solve the following linear programming model using the simplex method:

Minimize Z = - 45X1 - 15X2


Subject to:
4X1 + 3X2 ≤ 364,
X2 < 50,
0.8X1 + 0.5X2 ≤ 20,
X1 and X2 ≥ 0

5. Solve the following linear programming model using the simplex method:

Maximize Z = 3X1 - 2X2


Subject to:
X1 + X2 ≤ 3,
X1 = 1,
X1 & X2 ≥ 0
Operations Research Page 1 of 2
Final Answers
1. X1* = 4, X2* = 0, S1* = 0, S2* = 2, S3* = 1, R1* = 0, and Zmax = 16.
2. The solution is unbounded.
3. The problem has an infeasible solution.
4. X1* = 25, X2* = 0, S1* = 264, S2* = 50, S3* = 0, R1* = 0, and Zmax = 1,125.
5. X1* = 1, X2* = 0, S1* = 2, R1* = 0, and Zmax = 3.

Operations Research Page 2 of 2

You might also like