# Question: The management of the Albert Hanson Company is trying to

The management of the Albert Hanson Company is trying to determine the best product mix for two new products. Because these products would share the same production facilities, the total number of units produced of the two products combined cannot exceed two per hour. Because of uncertainty about how well these products will sell, the profit from producing each product provides decreasing marginal returns as the production rate is increased. In particular, with a production rate of R1 units per hour, it is estimated that Product 1 would provide a profit per hour of $200R1 – $100 R21. If the production rate of product 2 is R2 units per hour, its estimated profit per hour would be $300R2 – $100R22.

(a) Formulate a quadratic programming model in algebraic form for determining the product mix that maximizes the total profit per hour.

(b) Formulate this model on a spreadsheet.

(c) Use Solver (or ASPE) and its GRG Nonlinear solving method to solve this model.

(d) Use ASPE and its Quadratic solving method to solve this model.

(a) Formulate a quadratic programming model in algebraic form for determining the product mix that maximizes the total profit per hour.

(b) Formulate this model on a spreadsheet.

(c) Use Solver (or ASPE) and its GRG Nonlinear solving method to solve this model.

(d) Use ASPE and its Quadratic solving method to solve this model.

## Relevant Questions

The MFG Corporation is planning to produce and market three different products. Let x1, x2, and x3 denote the number of units of the three respective products to be produced. The preliminary estimates of their potential ...Suppose that the separable programming technique has been applied to a certain problem (the “original problem”) to convert it to the following equivalent linear programming problem: Maximize Z = 5x11 + 4x12 + 2x13 + 4x21 ...Reconsider the linearly constrained convex programming model given in Prob. 13.6-12. Starting from the initial trial solution (x1, x2) = (0, 0), use one iteration of the Frank-Wolfe algorithm to obtain exactly the same ...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 first quadratic programming variation of the Wyndor Glass Co. problem presented in Sec. 13.2 (see Fig. 13.6). Beginning with the initial trial solution (x1, x2) = (2, 3), use the automatic procedure in your ...Post your question