THERE IS NO EXCEL SHEET OR ATTACHMENT PROVIDED FOR THIS QUESTION

ALL OF THE INFORMATION IS GIVEN IS INCLUDED IN THE SCREENSHOT BELOW

Exhibit 3.2 The following questions are based on this problem and accompanying Excel windows. 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 races 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. Profit per Computer Model Plain Fancy Model (S) 30 40 Maximum demand for Wiring Hours product Required 80 4 90 S Hours Available SD Assembly Hours Required 5 4 SO Inspection Hours Required 2 3 22 Let X1 = Number of Plain computers to produce X2 - Number of Fancy computers to produce MAX Subject to: 30 X1 +40 X2 .4 X1 +.5 X2 s 50 (wiring hours) .5 X1 + 4 X2 50 (assembly hours) .2 X1 + 2 X2 s 22 (inspection hours) X1 s 80 (Plain computers demand) X2 5 90 (Fancy computers demand) X1 X220 A B D E Byte Computer Company 2 Plain Fancy 3 4 5 Total Profit: Number to make: Unit profit: 30 40 6 Used Available 0.4 0.5 SU 7 Constraints: 8 Wiring 9 Assembly 10 Inspection 11 Plain Demand 0.5 0.4 50 0.3 0.2 1 80 A B C D E 1 Byte Computer Company 2 3 Plain Fancy 4 Total Profit: Number to make: Unit profit: 5 30 40 6 7 Constraints: Used Available 0.4 0.5 50 0.5 0.4 50 8 Wiring 9 Assembly 10 Inspection 11 Plain Demand 12 Fancy Demand 0.2 0.3 22 80 1 90 Refer to Exhibit 3.2. Which cells should be the constraint cells in this problem? Selected Answer: b. E8:E12 Exhibit 3.2 The following questions are based on this problem and accompanying Excel windows. 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 races 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. Profit per Computer Model Plain Fancy Model (S) 30 40 Maximum demand for Wiring Hours product Required 80 4 90 S Hours Available SD Assembly Hours Required 5 4 SO Inspection Hours Required 2 3 22 Let X1 = Number of Plain computers to produce X2 - Number of Fancy computers to produce MAX Subject to: 30 X1 +40 X2 .4 X1 +.5 X2 s 50 (wiring hours) .5 X1 + 4 X2 50 (assembly hours) .2 X1 + 2 X2 s 22 (inspection hours) X1 s 80 (Plain computers demand) X2 5 90 (Fancy computers demand) X1 X220 A B D E Byte Computer Company 2 Plain Fancy 3 4 5 Total Profit: Number to make: Unit profit: 30 40 6 Used Available 0.4 0.5 SU 7 Constraints: 8 Wiring 9 Assembly 10 Inspection 11 Plain Demand 0.5 0.4 50 0.3 0.2 1 80 A B C D E 1 Byte Computer Company 2 3 Plain Fancy 4 Total Profit: Number to make: Unit profit: 5 30 40 6 7 Constraints: Used Available 0.4 0.5 50 0.5 0.4 50 8 Wiring 9 Assembly 10 Inspection 11 Plain Demand 12 Fancy Demand 0.2 0.3 22 80 1 90 Refer to Exhibit 3.2. Which cells should be the constraint cells in this problem? Selected Answer: b. E8:E12