# Math Help - Simplex Method, I need help setting up this word problem.

1. ## Simplex Method, I need help setting up this word problem.

Ace Electronics manufactures three different components for television sets. Component A requires 2 hours of fabrication and 1 hour of assembly
Component B requires 3 hours of fabrication and 1 hour of assembly
Component C requires 2 hours of fabrication and 2 hours of assembly.
The company has a maximum of 1,000 labor-hours of fabrication time and 800 labor - hours of assembly time available each week. The combined total number of components produced each week cannot exceed 420. The profit on each component A,B, and C is $7,$8, and \$10 respectively. How many components of each type should the company manufacture each week in order to maximum its profit (assume that all components manufactured can be sold?) What is the maximum profit?
So, would maximize be P = 7x1 + 8x2 + 10x3?

What would "subject to" be? I know it's like 3 equations, but what would they be?

2. Here's one of them,

$\displaystyle 2x_1+3x_2+ 2x_3 \leq 1000$

Look at my equation and try to link it back to the information, you do the next one.

3. Originally Posted by eliteplague
So, would maximize be P = 7x1 + 8x2 + 10x3?

What would "subject to" be? I know it's like 3 equations, but what would they be?
What you have written makes no sense because you have not defined x1, x2, and x3.