Question: Reformulate the following nonlinear knapsack problem into integer linear program. You don't need to solve it. max 11 ln(x1 + 1) + 8 ln(x2 +
Reformulate the following nonlinear knapsack problem into integer linear program. You don't need to solve it. max 11 ln(x1 + 1) + 8 ln(x2 + 1) + 6 ln(x3 + 1) + 4 ln(x4 + 1), s.t. 7x1 + 5x2 + 4x3 + 3x4 14, xj 0 and an integer, j = 1, . . . , 4.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
