# Question: A machine shop makes two products Each unit of the

A machine shop makes two products. Each unit of the first product requires 3 hours on machine 1 and 2 hours on machine 2. Each unit of the second product requires 2 hours on machine 1 and 3 hours on machine 2. Machine 1 is available only 8 hours per day and machine 2 only 7 hours per day. The profit per unit sold is 16 for the first product and 10 for the second. The amount of each product produced per day must be an integral multiple of 0.25. The objective is to determine the mix of production quantities that will maximize profit.

(a) Formulate an IP model for this problem.

(b) Solve this model graphically.

(c) Use graphical analysis to apply the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve this model.

(d) Now use the interactive procedure for this algorithm in your IOR Tutorial to solve this model.

(e) Check your answers in parts (b), (c), and (d) by using an automatic procedure to solve the model.

(a) Formulate an IP model for this problem.

(b) Solve this model graphically.

(c) Use graphical analysis to apply the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve this model.

(d) Now use the interactive procedure for this algorithm in your IOR Tutorial to solve this model.

(e) Check your answers in parts (b), (c), and (d) by using an automatic procedure to solve the model.

**View Solution:**## Answer to relevant Questions

Use the MIP branch-and-bound algorithm presented in Sec. 12.7 to solve the following MIP problem interactively: Maximize Z = 5x1 + 4x2 + 4x3 + 2x4, Subject to and xj ≥ 0, for j = 1, 2, 3, 4 xj is integer for j = 1, 2, 3. Reconsider Prob. 9.3-4, where a swim team coach needs to assign swimmers to the different legs of a 200-yard medley relay team. Formulate a BIP model for this problem. Identify the groups of mutually exclusive alternatives ...One of the constraints of a certain pure BIP problem is x1 + 3x2 + 2x3 + 4x4 ≤ 5. Identify all the minimal covers for this constraint, and then give the corresponding cutting planes. Consider the following problem: Maximize Subject to x1 ∈ {25, 30}, x2 ∈ {20, 25, 30, 35, 40, 50}, x3 ∈ {20, 25, 30}, x4 ∈ {20, 25}, all these variables must have different values, x2 + x3 + 60, x1 + x3 + 50. Poor inventory management at the local warehouse for Furniture City has led to overstocking of many items and frequent shortages of some others. To begin to rectify this situation, the 20 most popular kitchen sets in ...Post your question