Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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

See more answers at
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.

Join Brainly to access

this expert answer


To see the expert answer you'll need to create a free account at Brainly

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
Help with either of these would be great!
please x.x

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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.
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.
err okay haha

Not the answer you are looking for?

Search for more explanations.

Ask your own question