Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
12 views1 page

Sheet

Uploaded by

habibayasser20058
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
12 views1 page

Sheet

Uploaded by

habibayasser20058
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

Sheet (4)

Solve the following LP problems using the big M Method:

a) Maximize −3𝑥1 + 5𝑥2 b) Maximize −7𝑥1 − 15𝑥2 − 20𝑥3


Subject to 𝑥1 − 2𝑥2 ≤ 6 Subject to 𝑥1 + 2𝑥2 + 3𝑥3 ≥ 12
𝑥1 ≤ 10 𝑥1 + 3𝑥2 + 2𝑥3 ≥ 15
𝑥2 ≥ 1
𝑥1 ≥ 0, 𝑥2 ≥ 0 𝑥1 , 𝑥2 , 𝑥3 ≥ 0

c) Maximize 6𝑥1 + 4 𝑥2 d) Minimize 𝑥1 + 𝑥2


Subject to 𝑥1 + 𝑥2 ≤ 5 Subject to 2𝑥1 + 4𝑥2 ≥ 4
𝑥2 ≥ 8 𝑥1 + 7𝑥2 ≥ 7
𝑥1 , 𝑥2 ≥ 0 𝑥1 ≥ 0, 𝑥2 ≥ 0

e) Minimize −𝑥1 − 3𝑥2 +𝑥3 f) Minimize 3𝑥1 + 𝑥2


Subject to 𝑥1 + 𝑥2 + 2𝑥3 ≤ 4 Subject to 4𝑥1 + 𝑥2 = 4
−𝑥1 + 𝑥3 ≥ 4 5𝑥1 + 3𝑥2 ≥ 7
𝑥3 ≥ 3 3𝑥1 + 2𝑥2 ≤ 6
𝑥1 , 𝑥2 , 𝑥3 ≥ 0 𝑥1 , 𝑥2 ≥ 0

g) Maximize 2𝑥1 + 𝑥2 + 3𝑥3 h)


Subject to 𝑥1 + 𝑥2 + 2𝑥3 ≤ 5
2𝑥1 + 3𝑥2 + 4𝑥3 = 12
𝑥1 , 𝑥2 , 𝑥3 ≥ 0

OPTIMIZATION METHODS - 01202N – Fall 2024 1

You might also like