Question: Question 1: Integer Programing (Problem solving) (15 Marks) Six components, C1, C2, C3, C4, C5, C6, must be carried in a box that can hold

Question 1: Integer Programing (Problem solving)
Question 1: Integer Programing (Problem solving) (15 Marks) Six components, C1, C2, C3, C4, C5, C6, must be carried in a box that can hold up to 15 kg. The value and the weight associated to each of the components are listed below: C1 C2 C3 C4 C5 C6 Value (euro) 4 217 36 Weight (Kg) 5 8 8 615 At least 3 components must be carried in the box. Since the objective is to maximize the total value of the components introduced in the box and the weight capacity does not allow to carry them all, we need to choose some of them. The following binary variables have been defined: Xi = 0 if component Ci is selected to be carried in the box 1 otherwise The 0-1 IP model that represents the problem is: Max Z= 4x,+2x+x+7x+3x+6x Subject to 5x+8x+8x3+6x4+x+5x615 X+x+x3+x+x+x623 X1X2 X3 X4 X5 X6-0 or 1 Solve the problem using the 0-1 branch and bound algorithm and determine which of the 6 components will be selected to be carried in the box so as to maximize the total value of the selected components

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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

Students Have Also Explored These Related General Management Questions!