7 The following questions refer to the Giapetto problem (Section 3.1). Giapetto's LP was max z = 3x, + 2x2 2x, + x2 < 100 X, + x2 < 80 < 40 (Finishing constraint) (Carpentry constraint) (Limited demand for soldiers) st. (x, = soldiers and x2 = trains). After adding slack variables S1, 82, and s3, 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 $3.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 fin- ishing 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? TABLE 12 Basic Variable rhs 1 1 180 z = 180 1 -1 20 X1 = 20 1 -1 60 X2 = 60 -1 20 S3 = 20
7 The following questions refer to the Giapetto problem (Section 3.1). Giapetto's LP was max z = 3x, + 2x2 2x, + x2 < 100 X, + x2 < 80 < 40 (Finishing constraint) (Carpentry constraint) (Limited demand for soldiers) st. (x, = soldiers and x2 = trains). After adding slack variables S1, 82, and s3, 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 $3.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 fin- ishing 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? TABLE 12 Basic Variable rhs 1 1 180 z = 180 1 -1 20 X1 = 20 1 -1 60 X2 = 60 -1 20 S3 = 20
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 97 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,