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/ 9
DUALITY IN LPP
1. Write the dual of the given problem:
𝑀𝑎𝑥 𝑍 = 2𝑥1 − 4𝑥2 + 5𝑥3 − 6𝑥4 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 2𝑥1 − 4𝑥2 + 5𝑥3 − 6𝑥4 ≤ 2 −𝑥1 + 2𝑥2 + 3𝑥3 + 4𝑥4 ≤ 1 𝑥1 , 𝑥2 , 𝑥3 , 𝑥4 ≥ 0 2. Write the dual of the given problem: 𝑀𝑖𝑛 𝑍 = 2𝑥1 + 9𝑥2 + 𝑥3 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 4𝑥2 + 2𝑥3 ≥ 5 3𝑥1 + 𝑥2 + 2𝑥3 ≥ 4 𝑥1 , 𝑥2 , 𝑥3 ≥ 0 3. A computer company specializes in computerized tax returns and financial reports. • Each tax return requires 5 minutes of computer time, 40 minutes of staff review and 1 hour of packaging and yields a net profit of ₹ 250/-. • Each financial report requires 20 minutes of computer, 15 minutes of staff review and 1.5 hours of packaging and yields a net profit of ₹400/- In addition, each financial report must be reviewed by the consulting accountant for 10 minutes. The computer runs 7 hours a day and 5 staff members work for 8 hours a day. There are 200 hours of packaging and 7 hours of consulting available daily. The firm also has a contract to complete 25 returns each day. • Formulate an LPP • Give the dual of the above problem.
4. Apply the principle of duality to solve the LPP:
𝑀𝑎𝑥 𝑍 = 3𝑥1 + 3𝑥2 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 𝑥1 + 𝑥2 ≥ 1 𝑥1 + 𝑥2 ≤ 7 𝑥1 + 2𝑥2 ≤ 10 𝑥2 ≤ 3 𝑥1 , 𝑥2 ≥ 0 5. A company produces two items A and B using 3 resources namely sheet metal, equipment and labor. The input – output relationships, resource availability per week are as given below: i) Determine optimal product mix using simplex algorithm. ii) Interpret the umbers in the net evaluation row of the optimal tableau. Input Output Resource Product A Product B availability Sheet Metal 1 1 50 Labor Hours 1 2 80 Machine Hours 3 2 140 Profit/Unit ₹4/- ₹3/-