CORPORACIÓN UNIVERSITARIA DEL CARIBE – CECAR

FACULTAD DE CIENCIAS BÁSICAS, INGENIERÍAS Y ARQUITECTURA

INVESTIGACIÓN DE OPERACIONES II

ACTIVITY 2 – INTEGER PROGRAMMING: CUTTING PLANE METHOD

Solve the following Integer Programming Model problems by the cutting plane method. Include all
iterations using the Simplex or Simplex Dual Method. You can use TORA, as a tool to verify your
procedure, but you must detail the step by step (according to the method) of what was done. Find
the optimal solution.

1. Consider the following I.P:

Max . Z=5 X 1+8 X 2

S . A .:
X 1+2 X 2≤ 8
4 X 1+ X 2≤ 10
X 1 , X 2≥ 0 y enteros
2. Consider the following I.P:

M ín . Z=6 X 1+8 X 2
S . A .:
3 X 1+ X 2 ≥ 4
X 1+2 X 2≥ 4
X 1 , X 2≥ 0 y enteros

This is the Table with the results of Linear Programming.