Write the constraints for the problem, and graph the feasible region.?(algebra 2)?

Question

A shop makes tables and chairs. Each table takes 8 hours to assemble and 2 hours to finish. Each chair takes 3 hours to assemble and 1 hour to finish. The assemblers can work for at most 200 hours each week, and the finishers can work for at most 60 hours each week. The shop wants to make as many tables and chairs as possible. Write the constraints for the problem, and graph the feasible region. Let t be the number of tables and c be the number of chairs.

Answer 1

8t + 3c ≤ 200

2t + c ≤ 60

You want to maximize N = t + c

plot the graph and find the intersections... you may want to simply get the boundaries (lines) ...


btw .. points:
t = 10 & c = 40
t = 0 & c = 60
t = 25 & c = 0

§

Answer 2

you would need a graph with t and c as your axes

the two lines you would need to plot would be

8t + 3c = 200
2t + c = 60

which is about the time taken to fill up the available time to the assemblers and the finishers

use simultaneous equations to find the values where these two lines meet at t = 10/3 and c = 160/3 to find your optimal point of production that makes best use of both assemblers and fitters

Answer 3

i think with a view to completely answer this question, we'd desire to renowned the way 2+2 does not equivalent 4. yet right here is going: a) No, different than in stupid human beings. b) No, different than in stupid human beings. c) I fail to confirm how 2+2=4 in any sort of expression (written, pictorial or verbal) is tough and arranged, so no. d) You for sure would desire to make sparkling how 2+2=4 is unspecific. whether, I fail to confirm cloth changes between written, pictorial or verbal representations of this fact. e) you would be able to desire to make sparkling how writing has misled us. whether, writing helpful does shrink down on the memory load (think of integration with no pencil and paper) f) >we are left puzzled No, you're left puzzled. asserting A=A out loud makes suited sense to me and seems real in the id way. g) returned, i think no cloth difference. The equation nevertheless holds real if I 'write' it in my mind's eye, evaluate a variety line, count variety apples or precis it as much as available, in the confines of what i comprehend to be the sum of an identical 2 integers faraway from 0 in the helpful course. in all probability you would be able to desire to place off the mushrooms/LSD. Bob

Answer 4

t+c<=200+60
t>=0
c>=0
t>=8+2
c.=3+1

I think i got everything oh and does the problem give you the # of constraints possible or maybe count the number of spaces given?

Answer 5

t =/> 0
c=/> 0
8t + 3c =/< 200
2t + c =< 60
Feasible area corners are:
(0,0), (0,25), (40,10), and (60,0)