ps5 - Code/testing/instances/knap directory of the IE418...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 5 IE418 – Integer Programming Dr. Ralphs Due April 26, 2007 1. Nemhauser and Wolsey Section II.2.6, Problem 1. 2. Nemhauser and Wolsey Section II.2.6, Problem 4. 3. Nemhauser and Wolsey Section II.2.6, Problem 5. 4. Consider the following knapsack set. S = { x B 10 | 35 x 1 +27 x 2 +23 x 3 +19 x 4 +15 x 3 +15 x 6 +12 x 7 +8 x 8 +6 x 9 +3 x 10 39 } Using the knapsack solver 01branch and bound.run from Problem Set 3 (or any other solver of your choice), find at least three facets of the convex hull of S by lifting the bound constraints optimally. Do these facets have any recognizable structure. What are the magnitudes of the coefficients? 5. The tests below are to be with the knapsack instances in the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Code/testing/instances/knap directory of the IE418 SVN repository. In both cases, you can use the interactive solver to easily load each problem and change parameters between runs. (a) Using SYMPHONY , study the eect of generating valid inequalities (especially cover cuts) by solving knapsack instances with and without cut generation. Report on your ndings. (b) Using CPLEX, study the eect of preprocessing by solving knapsack instances with and without preprocessing. Report on your ndings. 1...
View Full Document

This note was uploaded on 08/06/2008 for the course IE 418 taught by Professor Ralphs during the Spring '08 term at Lehigh University .

Ask a homework question - tutors are online