1. Your furniture store sells two types of dining room tables. The first, type A, costs $265 and you make a $25 profit on each one. The second, type B, costs $100 and you make a $13 profit on each one. You can order no more than 40 tables this month, and you need to make at least $760 profit on them. If you must order at least one of each type of table, how many of each type of table should you order if you want to minimize your cost? Possible answers :

20 of type A; 20 of type B
2 of type A; 38 of type B
30 of type A; and 10 of type B
38 of type A; 2 of type B

Question

1. Your furniture store sells two types of dining room tables. The first, type A, costs $265 and you make a $25 profit on each one. The second, type B, costs $100 and you make a $13 profit on each one. You can order no more than 40 tables this month, and you need to make at least $760 profit on them. If you must order at least one of each type of table, how many of each type of table should you order if you want to minimize your cost?  Possible answers :

    20 of type A; 20 of type B
    2 of type A; 38 of type B
    30 of type A; and 10 of type B
    38 of type A; 2 of type B

anonymous · Answer

2.Given the system of constraints, name all vertices of the feasible region. Then find the maximum value of the given objective function.


Objective Function: C = 6x – 4y

anonymous · Answer

Help with either of these would be great!

anonymous · Answer

please x.x

anonymous · Answer

The process here is:
1) Graph each constraint.
2) Find the coordinates of each vertex.
3) For each vertex, plug the coordinates into the objective function. Compare the results for each vertex.

anonymous · Answer

Let's do the second problem first since the constraints are given to you on that one.
On the second problem, you have to figure out the constraints on your own.

anonymous · Answer

err okay haha