Operation Research 2
Pure Integer Programming
Group 9
Johan Ricardo Perez Figueroa
Cod. 20141020016
Juan David Cubillos Calvachi
Cod. 20141020050
The next questioner has 5 questions
with different options and only one
answer.
1. For the cutting planes method
is necessary:
a) Select the non-integer
numbers and choose the
number with largest fractional
part
b) Use php simplex programa
c) Divide the problem in two sub
problems
d) Take the number more near
to the result of simplex
method
Justification: the cutting method is
for does integer to all variables
problem.
2. The values of the variables in
the Pure Integer Programming
are:
a) Mixes and not-negatives
b) Only are reals and not-
negatives
c) 0, 1 y 2
d) All are integer and not-
negatives
Justification: the variables than we
are search, have restrictions of
integers and not-negatives
3. In 1950 Ralph Gomory wont
one method called:
a) Simplex Method
b) Branch and Bound
c) winqsb
d) cutting planes
Justificiation: Cutting Method y
called too Gomory Method
4. According to Branch and
bound, this method start in:
a) solution of Gomory
b) the optimal solution of
linear programming
c) the solution of egon balas
d) the relaxed problem
Justification: the metod of Branch
and Bound uses the optimal solution
of linear programming and add
restrictions for variables whose
solutions must be whole
5. The PIP is necessary in cases
of:
a) problems with negative
variables
b) more of 2 restrictions
c) we need solution integers
and not-negatives
d) variables with continues
values in all reals
Justification: the PIP is refered to
Pure Integer Programming.
Answers:
A B C D
1 x
2 x
3 x
4 x
5 x