You are a jeweler who sells necklaces and rings. Each necklace takes 4 ounces of gold and 2 diamonds

myntfalskj4 2022-07-02 Answered
You are a jeweler who sells necklaces and rings. Each necklace takes 4 ounces of gold and 2 diamonds to produce, each ring takes 1 ounce of gold and 3 diamonds to produce. You have 80 ounces of gold and 90 diamonds. You make a profit of 60 dollars per necklace you sell and 30 dollars per ring you sell, and want to figure out how many necklaces and rings to produce to maximize your profits.


Clearly this is a maximization problem, and this is how I formulated it.

Let n, r, g, and d represent units of necklaces, rings, gold, and diamonds, respectively.

Then, n = 4 g + 2 d, and r = g + 3 d.

Our profit can be defined by p = 60 n + 30 r.

Our constraints are g 80, and d 90.

I tried to approach solving this by substituting n and r for their production functions in the profit function. But, on second thought, I'm not sure if plugging them in maintains an equivalent profit function, because the gold/diamond amounts are tied together for each necklace/ring made.

So, I'm not sure if p = 60 n + 30 r and p = 60 ( 4 g + 2 d ) + 30 ( g + 3 d ) are equivalent statements.

Am I approaching this problem correctly? If not, how should I think about the problem? Thank you.
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

toriannucz
Answered 2022-07-03 Author has 16 answers
d = 3 r + 2 n 90 g = 1 r + 4 n 80
P = 30 r + 60 n
This then gives 3 allocations that maximize the use of resources.

All rings, All necklaces, and whatever combination is the solution to.
3 r + 2 n = 90 1 r + 4 n = 80
one of the 3 will be most profitable.

We have step-by-step solutions for your answer!

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-07-01
We’ve been given a triangle A B C with an area = 1. Now Marcus gets to choose a point X on the line B C, afterwards Ashley gets to choose a point Y on line A C and finally Marcus gets to choose a point Z on line AB. They can choose every point on their given line (Marcus: B C; Ashley: C A; Marcus: A B) except of A, B or C. Marcus tries to maximize the area of the new triangle X Y Z while Ashley wants to minimize the area of the new triangle. What is the final area of the triangle X Y Z if both people choose in the best possible way?
asked 2022-06-13
I got stuck in a some step
[ z P ( z | X , θ n ) ln ( P ( X | z , θ ) P ( z | θ ) P ( z | X , θ n ) ) ] ln ( P ( X | θ n ) )
which in the next line results in
= z P ( z | X , θ n ) ln ( P ( X | z , θ ) P ( z | θ ) P ( z | X , θ n ) P ( X | θ n ) )
What happened in between those lines?
asked 2022-07-08
I always saw the algorithm transform its objective function by log. I wonder this is because logarithm function is monotonically increased (logx) to do maximization, or decreased (−logx) to do minimization? So for MM algorithm, any functions should be transformed into log?

Are there also other reasons that log transformation is often used? I wonder log is always work or we have some mathematical operations that can replace log for this purpose?
asked 2022-07-09
Let { X 1 , , X K } is a set of random matrices, where X k R M × N , k = 1 , , K, and U R M × r and V R N × r are two matrices containing orthogonal columns (i.e., U U = I , V V = I). I was wondering, if the following question has a analytical solution:
max U , V k = 1 K U X k V F 2
If not, how should I solve it? Alternating optimization?

(At first, I thought it may be related to the SVD of the sum of the matrices { X k }, but so far I have no hint to prove it.)
asked 2022-06-21
Just come across a question regarding sequential maximization and simultaneous maximization, and I do not recall whether there are any established conditions for the equivalence. Anyone has some idea?
max x max y f ( x , y ) = max y max x f ( x , y ) ?
asked 2022-06-06
For fixed g, I want to find maximum b with
2 b ( 3 t 2 ( s + 1 ) + 6 t ( s + 1 ) + 3 s + 2 ) 2 g ( 6 t s + 3 t + 6 s + 2 ) 3 t s 2 + 6 t s + 3 t 3 s 2 + 3 s + 1 > 0
for some nonnegative reals t, s. Here g, b are also 0. Can it be possible to get a function f such that we get the upper bound on b as f ( g ) i.e, b < f ( g )? If one can find t, s for which b is maximum, one will get f ( g ).
asked 2022-05-08
Given a right circular cone with the line of symmetry along x = 0, and the base along y = 0, how can I find the maximum volume paraboloid (parabola revolved around the y-axis) inscribed within the cone? Maximising the volume of the paraboloid relative to the volume of the right circular cone. In 2-D, the parabola has 2 points of tangency to the triangle, one of each side of the line of symmetry. I have tried using the disk method to find the volume of the cone, and the parabola, both with arbitrary equations such as y = b a x, and y = c d x 2 , but I end up with a massive equation for several variables, instead of a simple percentage answer. Any help is appreciated! Thanks in advance.

New questions