# Question

The MFG Company produces a certain subassembly in each of two separate plants. These subassemblies are then brought to a third nearby plant where they are used in the production of a certain product. The peak season of demand for this product is approaching, so to maintain the production rate within a desired range, it is necessary to use temporarily some overtime in making the subassemblies. The cost per subassembly on regular time (RT) and on overtime (OT) is shown in the following table for both plants, along with the maximum number of subassemblies that can be produced on RT and on OT each day.

Let x1 and x2 denote the total number of subassemblies produced per day at plants 1 and 2, respectively. The objective is to maximize Z = x1 + x2, subject to the constraint that the total daily cost not exceed $60,000. Note that the mathematical programming formulation of this problem (with x1 and x2 as decision variables) has the same form as the main case of the separable programming model described in Sec. 13.8, except that the separable functions appear in a constraint function rather than the objective function. However, the same approach can be used to reformulate the problem as a linear programming model where it is feasible to use OT even when the RT capacity at that plant is not fully used.

(a) Formulate this linear programming model.

Let x1 and x2 denote the total number of subassemblies produced per day at plants 1 and 2, respectively. The objective is to maximize Z = x1 + x2, subject to the constraint that the total daily cost not exceed $60,000. Note that the mathematical programming formulation of this problem (with x1 and x2 as decision variables) has the same form as the main case of the separable programming model described in Sec. 13.8, except that the separable functions appear in a constraint function rather than the objective function. However, the same approach can be used to reformulate the problem as a linear programming model where it is feasible to use OT even when the RT capacity at that plant is not fully used.

(a) Formulate this linear programming model.

## Answer to relevant Questions

Consider the following nonlinear programming problem: Maximize Z = 5x1 + x2, subject to 2x12 + x2 ≤ 13 x12 + x2 ≤ 9 and x1 ≥ 0, x2 ≥ 0. (a) Show that this problem is a convex programming problem. (b) Use the ...Reconsider the linearly constrained convex programming model given in Prob. 13.6-13. Starting from the initial trial solution (x1, x2, x3) = (0, 0, 0), apply two iterations of the Frank- Wolfe algorithm. Consider the following linearly constrained convex programming problem: Maximize f(x) = 4x1 – x41 + 2x2 – x22, Subject to 4x1 + 2x2 ≤ 5 And x1 ≥ 0, x2 ≥ 0. Reconsider the quadratic programming model given in Prob. 13.7-4. Beginning with the initial trial solution (x1, x2) = (1/2, 1/2), use the automatic procedure in your IOR Tutorial to apply SUMT to this model with r = 1, ...Because of population growth, the state of Washington has been given an additional seat in the House of Representatives, making a total of 10. The state legislature, which is currently controlled by the Republicans, needs to ...Post your question

0