# Question: Consider the Wyndor Glass Co problem described in Sec 3 1

Consider the Wyndor Glass Co. problem described in Sec. 3.1 (see Table 3.1). Suppose that decisions have been made to discontinue additional products in the future and to initiate other new products. Therefore, for the two products being analyzed, the number of hours of production time available per week in each of the three plants will be different than shown in Table 3.1 after the first year. Furthermore, the profit per batch (exclusive of storage costs) that can be realized from the sale of these two products will vary from year to year as market conditions change. Therefore, it may be worthwhile to store some of the units produced in 1 year for sale in a later year. The storage costs involved would be approximately $2,000 per batch for either product.

The relevant data for the next three years are summarized next.

The production time per batch used by each product remains the same for each year as shown in Table 3.1. The objective is to determine how much of each product to produce in each year and what portion to store for sale in each subsequent year to maximize the total profit over the three years.

(a) Formulate this problem as a multitime period linear programming problem.

(b) Construct the corresponding table of constraint coefficients having the dual angular structure shown in Table 23.9.

The relevant data for the next three years are summarized next.

The production time per batch used by each product remains the same for each year as shown in Table 3.1. The objective is to determine how much of each product to produce in each year and what portion to store for sale in each subsequent year to maximize the total profit over the three years.

(a) Formulate this problem as a multitime period linear programming problem.

(b) Construct the corresponding table of constraint coefficients having the dual angular structure shown in Table 23.9.

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

Consider the following table of constraint coefficients for a linear programming problem. Show how this table can be converted into the form for multidivisional multitime period problems shown in Table 23.12 (with two ...Consider the following linear programming problem. Maximize Z = 2x1 + 4x2 + 3x3 + 2x4 + 5x5 + 3x6, subject to and xj ≥ 0, for j = 1, 2, . . . , 6. (a) Rewrite this problem in a form that demonstrates that it possesses the ...Consider the following game. Player A flips a fair coin until a head appears. She pays player B 2n dollars, where n is the number of tosses required until a head appears. For example, if a head appears on the first trial, ...Two machines produce a certain item. The capacity per day of machine 1 is 1 unit and that of machine 2 is 2 units. Let (X1, X2) be the discrete random variable that measures the actual production on each machine per day. ...The distribution of X, the life of a transistor, in hours, is approximated by a triangular distribution as follows: (a) What is the value of a? (b) Find the expected value of the life of transistors. (c) Find the CDF, FX(b), ...Post your question