Scribd
Upload
14 views1 page

Tutorial Sheet 3

Uploaded by

assaulterog18
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
14 views1 page

Tutorial Sheet 3

Uploaded by

assaulterog18
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

BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE-

PILANI,
HYDERABAD CAMPUS
Optimization (MATH F212)
Section No. 1
Instructor: Dr. Sumit Kumar Vishwakarma
Contact: [email protected]

Tutorial sheet-3
1. For the following LPP:
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑧 = 𝑥1 + 4𝑥2 + 7𝑥3 + 5𝑥4

𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 + 𝑥2 + 2𝑥3 + 4𝑥4 = 10


3𝑥1 − 𝑥2 − 2𝑥3 + 6𝑥4 = 5
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Generate the simplex table associated with the basis 𝑩 = (𝑃3, 𝑃4)

2. Consider the following LP:


𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑧 = 5𝑥1 + 12𝑥2 + 4𝑥3

𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 2𝑥2 + 𝑥3 + 𝑥4 = 10
2𝑥1 − 2𝑥2 − 𝑥3 = 2
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0
Check if each of the following matrices forms a (feasible or infeasible) basis:
(𝑃1, 𝑃2), (𝑃2 , 𝑃3 ), (𝑃3 , 𝑃4).
3. Consider an LP in which the variable 𝑥𝑘 is unrestricted in sign. Prove that by
substituting 𝑥𝑘 = 𝑥𝑘− − 𝑥𝑘+ , where 𝑥𝑘− and 𝑥𝑘+ are nonnegative, it is impossible
that the two variables will replace one another in an alternative optimum
solution.
4. Solve the following LPP using the revised simplex method:
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑧 = 5𝑥1 − 4𝑥2 + 6𝑥3 + 8𝑥4
subject to
𝑥1 + 7𝑥2 + 3𝑥3 + 7𝑥4 ≤ 46
3𝑥1 − 𝑥2 + 𝑥3 + 2𝑥4 ≤ 20
2𝑥1 + 3𝑥2 − 𝑥3 + 𝑥4 ≥ 18
𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0

You might also like