Perform a complete sensitivity analysis (objective function coefficients and right-hand-

side values) of the wooden toy soldier problem in Section 7.2 (Problem 1).

Data from problem 7.2

Consider a company that carves wooden soldiers. The company specializes in two main types: Confederate and Union soldiers. The profit for each is $28 and $30, respectively.
It requires 2 units of lumber, 4 hr of carpentry, and 2 hr of finishing to complete a Confederate soldier. It requires 3 units of lumber, 3.5 hr of carpentry, and 3 hr of finishing to complete a Union soldier. Each week the company has 100 units of lumber delivered. There are 120 hr of carpenter machine time available and 90 hr of finishing time available. Determine the number of each wooden soldier to produce to maximize weekly profits.

Data from section 7.2

Consider using the Chebyshev criterion to fit the model y = cx to the following data set: x | 1 2 3 y 258 The optimization problem that determines the parameter c to minimize the largest absolute deviation r;= ly; - y(x;)] (residual or error) is the linear program Minimize r subject to r-(2-c) 0 r+(2-c) 0 r- (5-2c) 0 r+(5-2c) 0 r-(8-3c) 0 r+ (8-3c) 0 In this section we solve this problem geometrically. (constraint 1) (constraint 2) (constraint 3) (constraint 4) (constraint 5) (constraint 6) (7.2)