# Question

The Whitt Window Company, a company with only three employees, makes two different kinds of hand-crafted windows: a wood-framed and an aluminum-framed window. The company earns $300 profit for each wood-framed window and $150 profit for each aluminum-framed window. Doug makes the wood frames and can make 6 per day. Linda makes the aluminum frames and can make 4 per day. Bob forms and cuts the glass and can make 48 square feet of glass per day. Each wood-framed window uses 6 square feet of glass and each aluminum-framed window uses 8 square feet of glass.

The company wishes to determine how many windows of each type to produce per day to maximize total profit.

(a) Describe the analogy between this problem and the Wyndor Glass Co. problem discussed in Sec. 3.1. Then construct and fill in a table like Table 3.1 for this problem, identifying both the activities and the resources.

(b) Formulate a linear programming model for this problem.

D, I (c) Use the graphical method to solve this model.

The company wishes to determine how many windows of each type to produce per day to maximize total profit.

(a) Describe the analogy between this problem and the Wyndor Glass Co. problem discussed in Sec. 3.1. Then construct and fill in a table like Table 3.1 for this problem, identifying both the activities and the resources.

(b) Formulate a linear programming model for this problem.

D, I (c) Use the graphical method to solve this model.

## Answer to relevant Questions

The WorldLight Company produces two light fixtures (products 1 and 2) that require both metal frame parts and electrical components. Management wants to determine how many units of each product to produce so as to maximize ...Read the referenced article that fully describes the OR study summarized in the application vignette presented in Sec. 4.3. Briefly describe the application of the simplex method in this study. Then list the various ...Label each of the following statements as true or false, and then justify your answer by referring to specific statements in the chapter. Work through the simplex method step by step (in tabular form) to solve the following problem. Maximize Z = 2x1 – x2 + x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Consider a two-variable linear programming problem whose CPF solutions are (0, 0), (6, 0), (6, 3), (3, 3), and (0, 2). (See Prob. 3.2-2 for a graph of the feasible region.) (a) Use the graph of the feasible region to ...Post your question

0