Scribd
Upload
15 views2 pages

MIP Problem Solving Techniques

The document discusses mixed integer programming questions. It asks multiple choice questions about techniques for solving mixed integer programming problems, including branch and bound method and cutting-plane method. Branch and bound method breaks the feasible region into two sub-problems at each step. Cutting-plane method derives Gomory cuts, which are constraints that satisfy all feasible integer solutions. Common solution techniques for mixed integer programming include Gomory's cut and branch and bound.

Uploaded by

Ricardo Rodriguez Naranjo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
15 views2 pages

MIP Problem Solving Techniques

The document discusses mixed integer programming questions. It asks multiple choice questions about techniques for solving mixed integer programming problems, including branch and bound method and cutting-plane method. Branch and bound method breaks the feasible region into two sub-problems at each step. Cutting-plane method derives Gomory cuts, which are constraints that satisfy all feasible integer solutions. Common solution techniques for mixed integer programming include Gomory's cut and branch and bound.

Uploaded by

Ricardo Rodriguez Naranjo
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

MIXED INTEGER PROGRAMMING QUESTIONS

1. When solving a problem of MIP using Branch and Bound Method, the feasible region: A. Is break up in two sub-problems B. Is break up in four sub-problems C. Is break up in three sub-problems D. Isnt break up in sub-problems E. Isnt break up in two sub-problems 2. Its true to affirm that in a MIP problem the variables have values: A. None continuous or Integer B. Some continuous and other Integer. C. Only continuous. D. Only Integer. E. Only Binary. 3. It is true to affirm that: A. In Branch and Bound Method all subproblems are solved by a relaxation model. B. Branch and Bound Method partitioned into four sub regions, the feasible region. C. Cutting-plane Method partitioned into two sub regions, the feasible region. D. Cutting-plane Method bound and discards some sub-problems. E. Cutting-plane Method derives a constraint that satisfies all feasible integer solutions, called Gomorys Cut

4. Solve a problem of LP-relaxation means: A. the constrains to Integer values arent deleted from the ILP-model B. the constrains to Continuous values arent deleted from the ILP-model C. the constrains to Integer values are deleted from the ILP-model D. the constrains to Continuous values are deleted from the ILP-model E. All the constrains are deleted from the ILP-model

5. Two solution techniques for solving a problem of MIP are: A. Enumerative method 0-1 and Balas Method B. Gomorys method 0-1 Cut and Enumerative

C. Balas Method and Branch and Bound D. Gomorys Cut and Branch and Bound E. Gomorys Cut and Balas Method
Modelos II Grupo 1 20081020062

Andrs Montoya arias Elvis Alexander Suarez A B Miguel ngel Montaez

D20081020060 E

Bibliografa. 2 X Gerard Sierksma, LINEAR XAND INTEGER 3 PROGRAMMING Theory and Practice Second 4 X Edition 5 X [Link] erainvestigacionoperativa [Link] /4060014/html/Capitulo%20VI/[Link] Hillier Frederick S., Lieberman Gerald J. , Investigacin de Operaciones 7 Edicin

feasible region into two successively smaller sub-problems. 2. B. In a problem of MIP some of the decision variables are integers and the others arbitrary real variables. 3. E. Cutting-plane Method derives a constraint that satisfies all feasible integer solutions, called Gomorys Cut 4. C. If the expression 'x integer' is deleted from the ILP-model, an LP-model called the LP-relaxation of the ILP-model is obtained 5. D. the most usually solutions technique for problem of MIP are Gomorys Cut and Branch and Bound.

JUSTIFICATION 1. A. The Branch-and-bound Method solves a model by breaking up its

You might also like