Question: Question 1: Use the Branch-Bound algorithm to solve the following Mixed-Integer Programming (MIP) problem: Maxs.t.x10,Z=2x1+x25x1+2x28x1+x23x20andX1onlyisinteger. Hint: Branch only X1 variable that is required to be

Question 1: Use the Branch-Bound algorithm to solve the following Mixed-Integer Programming (MIP) problem: Maxs.t.x10,Z=2x1+x25x1+2x28x1+x23x20andX1onlyisinteger. Hint: Branch only X1 variable that is required to be integer. (Do NOT branch X2 ). Question 2: The manufacturing Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 1,2, and 3 produce 12, 17, and 11 shipments per month, respectively. Each distribution center needs to receive 10 shipments per month. The distance from each plant to the respective distributing centers is given below: The freight cost for each shipment is $100 plus 50 cents per mile. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost? a) Formulate this problem as a transportation problem by constructing the appropriate parameter table. b) Draw the network representation of this
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
