How do you find the dimensions of the box that minimize the total cost of materials used if a rectangular milk carton box of width w, length l, and height h holds 534 cubic cm of milk and the sides of the box cost 4 cents per square cm and the top and bottom cost 8 cents per square cm?

Nathanael Perkins 2022-09-27 Answered
How do you find the dimensions of the box that minimize the total cost of materials used if a rectangular milk carton box of width w, length l, and height h holds 534 cubic cm of milk and the sides of the box cost 4 cents per square cm and the top and bottom cost 8 cents per square cm?
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)

baselulaox
Answered 2022-09-28 Author has 8 answers
Note that varying the length and width to be other than equal blackuces the volume for the same total (length + width); or, stated another way, w=l for any optimal configuration.
Using given information about the Volume, express the height (h) as a function of the width (w).
Write an expression for the Cost in terms of only the width (w).
Take the derivative of the Cost with respect to width and set it to zero to determine critical point(s).
Details:
Volume = w × l × h = w 2 h = 534
h = 534 w 2
Cost = (Cost of sides) + (Cost of top and bottom)
C = ( 4 × ( 4 w × h ) ) + ( 8 × ( 2 w 2 ) )
= ( 4 × ( 4 w × 534 w 2 ) + ( 8 × ( 2 w 2 ) )
= 8544 w - 1 + 16 w 2
d C d w = 0 for critical points
- 85434 w - 2 + 32 w = 0
Assuming w 0 we can multiply by w 2 and with some simple numeric division:
- 267 + w 3 = 0
and
w = ( 267 ) 1 3
=6.44 (approx.)
l = 6.44
and h=12.88 (approx.)
Did you like this example?
Subscribe for all access

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-13
I'm trying to solve the kind of linear equation below such that the sum of the unknowns is maximised, but have been unable to find the solution.
10 y 1 + 12 y 2 + 15 y 3 = 50
It may just be I am searching using the wrong terminology, if so direction of where to look would be greatly appreciated too.EDIT: To add some more information, the initial problem involved four equations.
y 1 = K 1 / x 1
y 2 = K 2 / x 2
y 3 = K 3 / x 3
x 1 + x 2 + x 3 = X
Where K and X values are given constants, and x and y values are unknown. I am trying to find a solution that maximises the sum of the y values.

It is from this problem that I simplified it to
K 1 y 1 + K 2 y 2 + K 3 y 3 = X
With the first equation in the initial question just being arbitrary values.
asked 2022-05-28
I am finding the extreme points of the function z = x 3 + y 3 ( x + y ) 2 . This function has two critical points (0;0) and (4/3;4/3). The second point is an extreme point. For the first point, I have no conclusion. I claimed it is not an extreme point. Clear, z < 0 when x , y < 0. I am looking for ( x ; y ) such that z > 0. Am I correct?
asked 2022-08-27
What is the largest area that can be fenced off of a rectangular garden if it will be fenced off with 220 feet of available material?
asked 2022-07-04
What is the Proximal Operator ( Prox) of the Pseudo L 0 Norm?
Namely:
Prox λ 0 ( y ) = arg min x 1 2 x y 2 2 + λ x 0
Where x 0 = n n z ( x ), namely teh number of non zeros elements in the vector x.
asked 2022-04-07
I want to ask whether the following question has a closed form solution:
{ min x c T x  s.t.  1 T x = b x 0
We can write down the kkt condition as:
L = c T x λ 1 , 1 T x b λ 2 , x L / x = c 1 λ 1 λ 2 = 0 [ λ 2 ] i x i = 0 [ λ 2 ] i 0
Denote ith component of c as c i . Now we can see that when ( c i λ 1 ) 0, then we must have x i = 0 and ( c i λ 1 ) = 0, we also must have x i > 0. But I am not sure how to proceed to the next.
asked 2022-07-17
An open top box is to be constructed so that its base is twice as long as it is wide. Its volume is to be 2400cm cubed. How do you find the dimensions that will minimize the amount of cardboard requiblack?
asked 2022-05-28
Suppose I have a problem of the form
m i n x ϵ , y 0 f ( x ) + g ( y ) x + y
subject to some (convex) inequality constraints and some affine equality constraints, and where f and g are known to be convex, and ϵ > 0 is some known constant. We can also assume that the feasible set is compact (in addition to being convex).

The main challenge here is when f ( x ) + g ( y ) x + y is not convex (otherwise it is just a convex problem), and also we don't have an easy escape like f and g are log convex, for example.

In my specific situation, I also know that f , g are of the form
f ( x ) = 0 x h f ( u )   d u   ,
and
g ( x ) = 0 x h g ( u )   d u   ,
for some (known) nondecreasing and integrable (but not necessarily continuous) functions h f : [ 0 , B f ] R and h g : [ 0 , B g ] R for some real numbers 0 < B f , B g < .

Are there any easy ways to tackle this sort of problem? I am hoping to find ways that would be computationally not much more difficult than convex optimization, but I am not sure if this is possible... it seems like even the simpler problem of minimizing f ( x ) / x is (surprisingly) difficult...