Scribd
Upload
8 views1 page

Assignment4opt SSP

The document presents optimization problems using the Simplex Method, including both maximization and minimization objectives. It includes four specific problems with defined objective functions and constraints for variables x1, x2, and x3, as well as x4 in one case. Each problem outlines the conditions under which the variables must remain non-negative.

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
8 views1 page

Assignment4opt SSP

The document presents optimization problems using the Simplex Method, including both maximization and minimization objectives. It includes four specific problems with defined objective functions and constraints for variables x1, x2, and x3, as well as x4 in one case. Each problem outlines the conditions under which the variables must remain non-negative.

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/ 1

Alexandria University SSP

Faculty of Engineering Optimization Techniques

Sheet 4: The Simplex Method


1- Maximize Z = x1 + 3 x 2 + 2 x 3 subject to
3x 1 − x 2 + 2 x 3 ≤ 7
− 2x1 + 4x 2 ≤ 12
4x1 − 3x 2 − 8x 3 ≥ −10
x1 , x 2 , x 3 ≥ 0

2- Maximize Z = 2x1 + 4x 2 + x 3 + x 4 subject to


x1 + 3x 2 + x 4 ≤ 4
2 x1 + x 2 ≤ 3
x 2 + 4x 3 + x 4 ≤ 3
x1 , x 2 , x 3 , x 4 ≥ 0

3- Maximize Z = 30x1 + 23x 2 + 29x 3 subject to


6x1 + 5x 2 + 3x 3 ≤ 52
4x1 + 2x 2 + 5x 3 ≤ 14
x1 , x 2 , x 3 ≥ 0

4- Minimize Z = x1 − 3 x 2 + 2 x 3 subject to
3x 1 − x 2 + 2 x 3 ≤ 7
− 2x1 + 4x 2 ≤ 12
− 4x1 + 3x 2 + 8x 3 ≤ 10
x1 , x 2 , x 3 ≥ 0

You might also like