Sample questions:

Code:

1. Complete the following integer program problem
by using branch and bound?
Min f = 4 x1 + 5 x2
Constraints
x1 + 4 x2 ≥ 5
3 x1 + 2 x2 ≥ 7
x1, x2 ≥ 0 and integers.
2. Complete the following integer program problem
by using branch and bound?
Max f = 4 x1 + 5 x2
Constraints
3 x1 + 2 x2 ≤ 10
x1 + 4 x2 ≤ 11
3 x1 + 3 x2 ≤ 13
x1, x2 ≥ 0 and integers.
3. Complete the following integer program problem
Gomory method?
Max f = 4 x1 + 6 x2 + 2 x3
Constraints
4 x1 - 4 x2 ≤ 5
- X1 + 6 x2 ≤ 5
- X1 + x2 + x3 ≤ 5
x1, x2 ≥ 0 and integers.
so many operational integer (integer programming), which must satisfy (linear mathematical model) linear programming.
about the above must meet three prerequisites:

Pure (all) integer programming (PIP)

- Mixed integer programming (MIP)
- Zero-one integer programming (ZIP).

please solution in the source code c + + dos (Borland compiler 5.0).