Week 3

Question 1

What is branch & Bound

Question 2

Constant Precision

Answer 2

is only relaly for non linear problems

Question 3

Automatic Scaling

Answer 3

if you are using very small and very large numbers, this should be checked on

Question 4

Integer optimality

Answer 4

the max% difference solver should accept between the best integer solution found and the best known bound on the true optimal objective value BEFORE STOPPING

Question 5

What is Binary Integer programming BIP

Answer 5

Categorical decisions, YES=1, NO=0

Question 6

Examples of BIP

Answer 6

-> Capital Budgeting (Invest or Dont)
-> Fixed Cost (An all or nothing cost! that is not variable on per unit production)
-> Location Planning/Set Covering (Here, or Not)

Question 7

when changing cells are both integer and non integer?

Answer 7

MIXED INTEGER PROGRAMMING

Question 8

Set Covering

Answer 8

BASICALLY ITS A EYS OR NO!

Question 9

How to do set covering

Answer 9

1. copy all the set! make a new section
   2.in this new section have the YES or NO
2. Declare decision variables (what choice are you making?) (BINARY)
3. now add a new area where you have a “covered?” as a binary area (AS A DECISION VARIABLE) AGAIN! this will prevent double counting