z #1, #2, #3 20 The optimal tableau is below. RRE Toyco assembles three types of...

 

Transcribed Image Text:

z #1, #2, #3 20 The optimal tableau is below. RRE Toyco assembles three types of toys-trains, trucks, and cars-using three operations. The daily limits on the available times for the three operations are 430, 460, and 420 minutes, respectively, and the revenues per unit of toy train, truck, and car are $3. $2. and $5, respectively. The assembly times per train at the three operations are 1, 3, and 1 minutes, respectively. The corresponding times per train and per car are (2, 0, 4), and (1, 2, 0) minutes (a zero time indicates that the operation is not used). Letting x, x, and x3 represent the daily number of units assembled of trains, trucks, and cars, respectively, the associated LP model is written as Maximize 3x1 +223 +523 s.t.: 21 +222 +23 S 430 (Operation 1) 3a1 + 2x3 460 (Operation 2) +422 420 (Operation 3) 53 XI 4 -1/4 X3 3/2 20000 1 x3 $1 0 1 1/2 0 1 0 52 -1/4 1/2 0 -2 1 10001 1350 100 230 20 What is the maximum amount we can increase the availability of operation 1 without changing the optimal basis? z #1, #2, #3 20 The optimal tableau is below. RRE Toyco assembles three types of toys-trains, trucks, and cars-using three operations. The daily limits on the available times for the three operations are 430, 460, and 420 minutes, respectively, and the revenues per unit of toy train, truck, and car are $3. $2. and $5, respectively. The assembly times per train at the three operations are 1, 3, and 1 minutes, respectively. The corresponding times per train and per car are (2, 0, 4), and (1, 2, 0) minutes (a zero time indicates that the operation is not used). Letting x, x, and x3 represent the daily number of units assembled of trains, trucks, and cars, respectively, the associated LP model is written as Maximize 3x1 +223 +523 s.t.: 21 +222 +23 S 430 (Operation 1) 3a1 + 2x3 460 (Operation 2) +422 420 (Operation 3) 53 XI 4 -1/4 X3 3/2 20000 1 x3 $1 0 1 1/2 0 1 0 52 -1/4 1/2 0 -2 1 10001 1350 100 230 20 What is the maximum amount we can increase the availability of operation 1 without changing the optimal basis?

Answer rating: 100% (QA)

SOLUTION The LP ... View the full answer