Exhibit 4.3: The following question is 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.

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