Scribd
Upload
10 views

Tutorial sheet-5

The document contains a tutorial sheet from the School of Mathematics at Thapar University focused on solving Integer Linear Programming Problems using the Branch and Bound Algorithm. It presents eight problems with their respective constraints and objectives, followed by the solutions for each problem. The solutions include maximum and minimum values for the objective functions along with the corresponding integer values of the variables.

Uploaded by

Sparsh Goyal
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
10 views

Tutorial sheet-5

The document contains a tutorial sheet from the School of Mathematics at Thapar University focused on solving Integer Linear Programming Problems using the Branch and Bound Algorithm. It presents eight problems with their respective constraints and objectives, followed by the solutions for each problem. The solutions include maximum and minimum values for the objective functions along with the corresponding integer values of the variables.

Uploaded by

Sparsh Goyal
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

School of Mathematics, Thapar University

Optimization Techniques (UMA-031)


Tutorial Sheet # 5

1. Solve the following Integer Linear Programming Problems (ILPP) by Branch and Bound
Algorithm:

(i) Max z  3x1  2 x2 , s / t 2 x1  5x2  9, 4 x1  2 x2  9, x1, x2  0 and integer.

(ii) Max z  2 x1  3 x2 , s / t 5x1  7 x2  35, 4 x1  9 x2  36, x1, x2  0 and integer.

(iii) Max z  5x1  7 x2 , s / t 2 x1  x2  13, 5x1  9 x2  41, x1, x2  0 and integer.

(iv) Max z  7 x1  9 x2 , s / t  x1  3x2  6, 7 x1  x2  35, x1  7, x2  7, x1 , x2  0 and integer.

(v) Max z  3x1  4 x2 , s / t 7 x1 16 x2  52, 3x1  2 x2  9, x1, x2  0 and integer.

(vi) Min z  5x1  4 x2 , s / t 3x1  2 x2  5, 2 x1  3x2  7, x1, x2  0 and integer.

(vii) Min z   3x1  4 x2 , s / t 3x1  x2  12, 3x1  11x2  66, x1 , x2  0 and integer.

(viii) Max z  2 x1  3 x2 , s / t 6 x1  5x2  x3  25, x1  3x2  x4  10, x1 , x2 , x3 , x4  0 and x1, x2 are integers.

Solutions:

(i) Max z  6, x1  2, x2  0.
(iv) Max z  55, x1  4, x2  3.
(v) Max z 14, x1  2, x2  2.
(vi) Min z 12, x1  0, x2  3.
(vii) Min z   31, x1  5, x2  4.
(viii) Max z 11, x1  1, x2  3.

You might also like