Big Pine Computing produces two computers, Latitude and Longitude, and wants to plan production for next month to maximize profits. Producing these computers requires wiring, assembly and inspection time. Each computer produces a certain level of profits but has a limited demand. There are also a limited number of wiring, assembly and inspection hours available in each month.

		Maximum		Assembly	Inspection
Computer	Profit per	demand for	Wiring Hours	Hours	Hours
Model	Model ($)	product	Required	Required	Required
Latitude	30	80	.4	.5	.2
Longitude	40	90	.5	.4	.3
		Hours Available	50	50	22

Let X₁ = Number of Latitude computers to produce

X₂ = Number of Longitude computers to produce

MAX: 30X₁ + 40X₂

Subject to: .4X₁ + .5X₂ 50 (wiring hours)

.5X₁ + .4X₂ 50 (assembly hours)

.2X₁ + .2X₂ 22 (inspection hours)

X₁ 80 (Latitude computers demand)

X₂ 90 (Longitude computers demand)

X₁, X₂ 0

	A	B	C	D	E
1		Big Pine Computing
2
3		Latitude	Longitude
4	Number to make:				Total Profit:
5	Unit profit:	30	40
6
7	Constraints:			Used	Available
8	Wiring	0.4	0.5		50
9	Assembly	0.5	0.4		50
10	Inspection	0.2	0.3		22
11	Latitude Demand	1			80
12	Longitude Demand		1		90

In the above spreadsheet, which cells should be the constraint cells?

		E8:E12
		B4:C4
		D8:D12
		E5