IE 505 Study Set

# IE 505 Study Set - Consider the following feasible set of a...

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

IE 505 Study Set Question 1: Consider the following problem: Maximize 6x 1 2x 2 + 2x 3 2 Subject to: 3x 1 + 3x 2 3x 3 -x 1 + 2x 2 + x 3 2 = 0 a) Write the Kuhn-Tucker optimality conditions. b) Using the above conditions, find the optimal solution to the problem. Question 2:
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Consider the following feasible set of a Knapsack problem X={x{0,1} 7 : 2x 1 + 3x 2 + 6x 3 + 7x 4 + 5x 5 + 9x 6 + 4x 7 <= 9} Generate cover inequalities for this set, and find the corresponding extended covers. Question 4: Consider the following IP...
View Full Document

• Spring '10
• zeynephuygur
• Following, Computational complexity theory, Knapsack problem, Cover version, Study Set Question, Kuhn-Tucker optimality conditions.

{[ snackBarMessage ]}

Ask a homework question - tutors are online