Exhibit 4.3: The following questions are based on this problem and accompanying Solver sensitivity report.

The Byte computer company produces two models of computers, Plain and Fancy. It wants to plan how many computers to produce next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but faces only a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month. The data for this problem is summarized in the following table.

In the provided blank, insert the letter that corresponds with the correct answer. For example, if the correct answer is "a. 2.5", insert "a" as the correct answer.

Computer	Profit per	Maximum demand for	Wiring Hours	Assembly Hours	Inspection Hours
Model	Model ($)	product	Required	Required	Required
Plain	35	80	.4	.5	.2
Fancy	40	90	.5	.4	.2
		Hours Available	50	50	22

LetX1= Number of Plain computers to produce

X2= Number of Fancy computers to produce

The LP model for the problem is

MAX:35X1 + 40 X2

Subject to:.4 X1 + .5 X2 ? 50 (wiring hours)

.5 X1 + .4 X2 ? 50 (assembly hours)

.2 X1 + .2 X2 ? 22 (inspection hours)

X1? 80 (Plain computers demand)

X2? 90 (Fancy computers demand)

X1, X2 ? 0

Variable Cells Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $A$4 X1 50 0 35 5 3 5854 X2 60 0 40 3.75 5 Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H.Side Increase Decrease $C$7 50 50 50 3 1 $C$8 49 O 50 1E+30 1 $C$9 22 75 22 0.222222222 1.5 $C$10 50 0 8O 1E+30 30 $C$11 60 0 9O 1E+30 3O