Question: How do we classify an integer programming problem as linear or non-linear, continous or discrete? Also, how do we decide which algorithm to use among
How do we classify an integer programming problem as linear or non-linear, continous or discrete?
Also, how do we decide which algorithm to use among Branch and bound, cutting planes, lagrangian relaxation and Gomory cuts?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
