Scribd
Upload
19 views

Assignment-2 (2)

The document is an assignment for Mathematics-IV (MTH-241) at Maulana Azad National Institute of Technology Bhopal, due in the Even Semester of 2023-24. It contains a series of problems related to linear programming, including finding duals, solving primal problems, and applying graphical and algorithmic methods. The assignment includes various tasks such as maximizing and minimizing functions under given constraints, and utilizing techniques like the Cutting Plane Algorithm and branch and bound approach.

Uploaded by

HEMANG MODI
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
19 views

Assignment-2 (2)

The document is an assignment for Mathematics-IV (MTH-241) at Maulana Azad National Institute of Technology Bhopal, due in the Even Semester of 2023-24. It contains a series of problems related to linear programming, including finding duals, solving primal problems, and applying graphical and algorithmic methods. The assignment includes various tasks such as maximizing and minimizing functions under given constraints, and utilizing techniques like the Cutting Plane Algorithm and branch and bound approach.

Uploaded by

HEMANG MODI
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/ 2

Maulana Azad National Institute of Technology Bhopal

Department of Mathematics, Bioinformatics and Computer Applications


Mathematics-IV (MTH-241)

Assignment-3 Due Date: Even Sem: 2023-24

1. Write the dual of the following linear programming problem:


Maximize 8x1 + 3x2 − 2x3
subject to x1 − 6x2 + x3 > 2
5x1 + 7x2 − 2x3 = −4
x1 ≤ 0, x2 ≥ 0, x3 unrestricted.

2. Write the dual of the following linear programming problem:


Maximize 12x1 + 2x2
subject to 8x1 − x2 ≤ 21
x1 − 6x2 ≥ 13
3x1 − 4x2 = −11
x1 unrestricted, x2 ≥ 0.

3. Consider the following primal and dual problems:


P: Minimize −x1 − x2
subject to −x1 − x2 ≥ 1
−x1 + x2 ≥ 1
x1 , x2 ≥ 0
D: Maximize w1 + w2
subject to −w1 − w2 ≤ −1
−w1 + w2 ≤ −1
w1 , w2 ≥ 0
Using graphical method discuss the solution of both the problems.

4. Consider the following primal problem:


Minimize 2x1 + 3x2 + 5x3 + 2x4 + 3x5
subject to x1 + x2 + 2x3 + x4 + 3x5 ≥ 4
2x1 − 2x2 + 3x3 + x4 + x5 ≥ 3
x1 , x2 , x3 , x4 , x5 ≥ 0
Solve the primal problem by finding the optimal solution of its dual problem.

5. Consider the following problem:


Maximize 2x1 + 4x2 + 5x3
subject to x1 + x2 + x3 ≤ 8
x1 − x2 + 3x3 ≤ 4
x1 , x2 , x3 ≥ 0

1
(a) Find the optimal solution.
(b) Find a new optimal solution if the cost coefficient c2 changes from 4 to −4.
(c) Determine optimal solutions as the cost coefficient c2 varies over the entire real line
(−∞, ∞).

6. Consider the following problem:


Maximize z = 11x1 + 4x2 + x3 + 15x4
subject to 3x1 + x2 + 2x3 + 4x4 ≤ 28
8x1 + 2x2 − x3 + 7x4 ≤ 50
x1 , x2 , x3 , x4 ≥ 0
Suppose two changes are made in the coefficients of z: the coefficient of x1 is increased
from 11 to 13 and the coefficient of x4 is increased from 15 to 15 43 . Note that (0, 4, 0, 6)
is the optimal solution to the original problem but no longer optimal to the modified
problem. Solve the modified problem.
7. Consider the following problem:
Maximize 5x1 + 2x2
subject to 6x1 + 2x2 ≤ 13
−6x1 + 7x2 ≤ 14
x1 , x2 ≥ 0 and integral

(a) Show graphically that the optimal solution to the original restricted variable problem
is at (2, 0).
(b) Using the simplex algorithm, show that the optimal value of the objective function
of the problem with the integral restrictions ignored is 11 65 and is attained at the
point (1 16 , 3).

8. Solve the following using the Cutting Plane Algorithm.


Maximize x1 + 3x2
subject to −x1 + 3x2 ≤ 6
2x1 + x2 ≤ 12
x1 , x2 ≥ 0 and integral
9. Solve the following using the Cutting Plane Algorithm.
Maximize 2x1 − 4x2 + x3
subject to x1 − x2 ≤ 12
2x2 + 3x3 ≤ 28
x1 , x2 , x3 ≥ 0 and integral
10. Solve the following using the branch and bound approach.
Maximize 4x1 + 5x2 + 3x3
subject to 3x1 − 2x2 + x3 ≤ 15
x1 + 2x2 + x3 ≤ 8
x1 , x2 , x3 ≥ 0 and integral

You might also like