The following questions refer to the Giapetto problem (Section 3.1). Giapetto’s LP was

(x1 = soldiers and x2 = trains). After adding slack variables s2, and the optimal tableau is as shown in Table 12.

Use this optimal tableau to answer the following questions:

a. Show that as long as soldiers (x1) contribute between $2 and $4 to profit, the current basis remains optimal. If soldiers contribute S3.50 to profit, find the new optimal solution to the Giapetto problem.

b. Show that as long as trains (x2) contribute between $1.50 and $3.00 to profit, the current basis remains optimal.

c. Show that if between 80 and 120 finishing hours are available, the current basis remains optimal. Find the new optimal solution to the Giapetto problem if 90 finishing hours are available.

d. Show that as long as the demand for soldiers is at least 20, the current basis remains optimal.

e. Giapetto is considering manufacturing toy boats. A toy boat uses 2 carpentry hours and 1 finishing hour. Demand for toy boats is unlimited. If a toy boat contributes $3.50 to profit, should Giapetto manufacture any toy boats?
    

z	x1	x2	s1	s2	s3	rhs	Basic Variable
1	0	0	1	1	0	180	z   = 180
0	1	0	1	−1	0	20	x1 = 20
0	0	1	−1	2	0	60	x2 = 60
0	0	0	−1	1	1	20	s3 = 20

Transcribed Image Text:

max z = 3.x, + 2r, 2x, + x2 s 100 (Finishing constraint) (Carpentry constraint) (Limited demand for soldiers) s.t. X + x2s 80 S 40 max z = 3.x, + 2r, 2x, + x2 s 100 (Finishing constraint) (Carpentry constraint) (Limited demand for soldiers) s.t. X + x2s 80 S 40

Answer rating: 100% (QA)

phase 1 Consider the following Linear Program phase 2 Follow the steps below to demonstrate that the ... View the full answer