Question: Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively: Minimize Z = 5x1 + 6x2 + 7x3 + 8x4

Use the BIP branch-and-bound algorithm presented in Sec. 12.6 to solve the following problem interactively:
Minimize Z = 5x1 + 6x2 + 7x3 + 8x4 + 9x5,
Subject to
3x, - X, + X, + x - 2x, 2 2 X2 + X, - 2xg 2 2 2x4 X1 + 3x, - X - 2r, + xg 20 -XI - X2 + 3x + X4 + Xs 1

and
xj is binary, for j = 1, 2, . . . , 5.

3x, - X, + X, + x - 2x, 2 2 X2 + X, - 2xg 2 2 2x4 X1 + 3x, - X - 2r, + xg 20 -XI - X2 + 3x + X4 + Xs 1

Step by Step Solution

3.38 Rating (167 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Optimal Solution 1 0 1 0 0 Z 12 ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

545-M-S-L-P (663).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!