Scribd
Upload
4 views

Assignment 4

The document is an assignment for the MA515-Applied Mathematical Programming course at the Indian Institute of Technology Mandi, focusing on duality theory in linear programming. It includes problems related to finding the dual of given linear programming problems, verifying solutions, proving properties of primal and dual problems, and solving linear programming problems using the Dual Simplex Method. The assignment is structured into multiple sections with specific tasks for students to complete.

Uploaded by

math.master1230
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment 4

The document is an assignment for the MA515-Applied Mathematical Programming course at the Indian Institute of Technology Mandi, focusing on duality theory in linear programming. It includes problems related to finding the dual of given linear programming problems, verifying solutions, proving properties of primal and dual problems, and solving linear programming problems using the Dual Simplex Method. The assignment is structured into multiple sections with specific tasks for students to complete.

Uploaded by

math.master1230
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Indian Institute of Technology Mandi

भारतीय ौ ोिगक सं थान म डी


MA515-Applied Mathematical Programming
Assignment : 4 (Duality Theory)
Odd Semester : 2022-23

1. Find the dual of following LPP:

(a) x1 , x2 ≥ 0, and x3 is unrestricted


Maximize f (x) = 2x1 + x2
(d)
Subject to
x1 + 5x2 ≤ 10 Minimize f (x) = 3x1 + 2x2 + x3
x1 + 3x2 ≥ 6
Subject to
2x1 + 2x2 ≤ 8
−3x1 + 2x2 + 2x3 = 8
x1 is unrestricted, x2 ≥ 0 −3x1 + 4x2 + x3 = 7
(b) x1 , x2 , x3 are unrestricted
Maximize f (x) = 3x1 + 5x2
Subject to (e)
x1 ≤ 4
Minimize f (x) = 2x1 − x2 + 2x3
x2 ≤ 6
3x1 + 2x2 ≤ 18 Subject to
x1 , x2 ≥ 0 −x1 + x2 + x3 = 4
−x1 + x2 − x3 ≤ 6
(c) −x1 , x2 ≥ 0, x3 ∈ R
Minimize f (x) = x1 + x2 + x3
Subject to
x1 − 3x2 + 4x3 = 5
x1 − 2x2 ≤ 3
2x2 − x3 ≥ 4

2. Consider the following LPP:


Maximize f (x) = 8x1 + 6x2
Subject to
3
x1 − x2 ≤
5
x1 − x2 ≥ 2
x1 , x2 ≥ 0
Verify that both the primal and dual problems have the same solution.
3. Prove that if primal (P ) is not infeasible and dual (D) is infeasible, then the primal (P ) is unbounded.
4. For the given LPP:
Minimize f (x) = x1 + 2x2 − 3x3
Subject to
x1 + 2x2 + 2x3 = 2
−x1 + x2 + x3 = 1
−x1 + x2 − x3 ≥ 0
x1 , x2 , x3 ≥ 0
x1 0
" # " #
Verify whether x2 = 1 is an optimal solution to the primal or not by using Complementary Slackness Theorem.
x3 0
5. Solve the following LPP by using Dual Simplex Method.

1
(a)
Minimize f (x) = x1 + 2x2
Subject to
2x1 + x2 ≥ 4
x1 + 7x2 ≥ 7
x1 , x2 ≥ 0
(b)
Maximize f (x) = −2x1 − x2
Subject to
3x1 + x2 ≥ 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≥ 3
x1 , x2 ≥ 0
(c)
Maximize f (x) = 2x3
Subject to
−x1 + 2x2 − 2x3 ≥ 8
−x1 + x2 + x3 ≤ 4
2x1 − x2 + 4x3 ≤ 10
x1 , x2 , x3 ≥ 0
(d)
Minimize f (x) = 2x1 + 9x2 + 24x3 + 8x4 + 5x5
Subject to
x1 + x2 + 2x3 − x5 − x6 = 1
−2x1 + x3 + x4 + x5 − x7 = 2
x1 , x2 , x3 , x4 , x5 , x6 , x7 ≥ 0

You might also like