Question: (a) By branching on x 2 , use the branch-and-bound method to solve the following integer programming problem (IP): Maximize z 6x 1 + 2x

(a) By branching on x 2 , use the branch-and-bound method to solve the following integer programming problem (IP): 

Maximize z 6x 1 + 2x 2  

Subject to 

5x 1 + x 2 ≤ 10 

2x 1 +x 2 ≤ 9 

x 1 . x 2   ≥ 2 0; x 1 , x 2 integer. 

b) A hiker has a 5-ft backpack and needs to decide on the most valuable items to take on the hiking trip. There are three items from which to choose. Their volumes are 2, 3, and 4 ft 3,  and the hiker estimates their associated values on a scale from 0 to 100 as 30, 50, and 70, respectively. Formulate the problem as an LP model and what kind of linear programming is it?

Step by Step Solution

3.40 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Image No 5... 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

Students Have Also Explored These Related Mathematics Questions!