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 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. Computer Model Plain Fancy Profit per Model ($) 30 40 Maximum demand for Wiring Hours product Required 80 .4 90 .5 Hours Available 50 Assembly Hours Required .5 4 50 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