Question: can you solve this question with box technique by showing every step please it wil really help me to understand this question. thanks you for
5. Consider the following knapsack problem. maxz=3x1+7x2+5x3+4x42x1+3x2+5x3+3x46x1,x2,x3,x4{0,1}. a. Give the LP relaxation to this problem. b. Do you agree that the inequality x3+x41 is a cut for this problem? Explain. c. Solve the problem using brach and bound algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
