Comprehension questions for Integer Programming
Please answer these questions concisely (1-2 sentences each).
First Name *
Last Name *
Email *
In formulating a BIP, if either x_1 or x_2 can be equal to 1, how would you enforce this via a constraint? *
When do we need to use the "Big-M" trick? *
IPs have fewer feasible solutions than LPs. Why does that not imply that IPs are easier to solve than LPs? *
Explain how the LP relaxation is used in the branch-and-bound algorithm. *
Which (sub-)section in the readings did you find difficult and/or did you not fully understand and/or would you like see covered in the lecture in detail. Be as specific as you like. *
Never submit passwords through Google Forms.
This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy