Question

In: Advanced Math

Optimization Problem

We want to construct a box whose base length is three times the base width. The material used to build the top and bottom cost $10/ft2 and the material to build the sides cost $6/ft2 . If the box must have volume 50 ft3 , what is the minimum cost of the box?

Solutions

Expert Solution

We start by drawing a picture of the box. We have the following formula for the volume of the box V = lwh

50 = 3w^2h

(1) We also have the following formula for the cost of the box

C = 2(area of top/bottom)(10) + 2(area of front/back)(6) + 2(area of sides)(6) = 2(3w 2 )(10) + 2(3wh)6 + 2(wh)(6)

C = 60w^2 + 36wh + 12wh

C= 60w^2 + 48wh

(2) So we have written the cost as a function of two variable, height and width. But we would like to rewrite the cost as the function of only one variable (probably width). This is where we look back at equation (1) and solve for h in terms of w. That is

h = 50/3w^2

 (3) Plugging the value for h from (3) above into equation (2) yields

C = 60w^2 + 48w ( 50 3w^2 )= 60w^2 + 800/w

(4) Now we want to minimize cost. To do this we want to find the critical points of C and hope that one is our absolute minimum. We have C

0 = 120w − 800/w^2

= 120w^3 − 800/w^2 

(5) Then the critical points of C are w = 0 and w = 3 under root 800 12 ≈ 1.8821. Clearly w = 0 does not make any sense so we throw out that point. We then notice that when w < 1.88, C0 (w) < 0 and when w > 1.88, C0 (w) > 0 so we can conclude that w = 1.88 is an absolute minimum. Our final step is to find cost of the box at this point. We get C(1.8821) = $637.60


We start by drawing a picture of the box

Related Solutions

Solve the following optimization problem (Be sure to include the statement of the optimization problem and...
Solve the following optimization problem (Be sure to include the statement of the optimization problem and a graph of the feasible in your solution): Jamie has joined a building contest. A dog shape requires 3 small blocks and one large block to build. A robot shape requires 5 small bricks and 5 large bricks to build. Jamie has a supply of 240 small bricks and 100 large bricks. If a dog is worth 2 points and a robot is worth...
Explain the concept of optimization. Explain the general procedure used to do an optimization problem. Use...
Explain the concept of optimization. Explain the general procedure used to do an optimization problem. Use an example and include steps
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible...
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible value. Using greedy paradigm, we can solve this problem easily. Your task is the following: (a) Write the pseudo-code of a greedy solution for knapsack problem. (b) Give is the time complexity of your solution in part (a). (c) Implement part (a) in C programming language.
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible...
The Knapsack problem is an optimization problem that asks to fill a knapsack with maximum possible value. Using greedy paradigm, we can solve this problem easily. Your task is the following: (a) Write the pseudo-code of a greedy solution for knapsack problem. (b) Give is the time complexity of your solution in part (a). (c) Implement part (a) in C programming language.
2 Optimization Use fminsearch to solve the following unconstrained optimization problem. min x∈R4 f(x) = (x1...
2 Optimization Use fminsearch to solve the following unconstrained optimization problem. min x∈R4 f(x) = (x1 + 10x2)^2 + 5(x3 − x4)^2 + (x2 − 2x3)^4 + 10(x1 − x4)^4 Use the following as initial guess x0 = [3 -1 0 1] (x0 us a column not a row) What is the minimizer you find, and what is the value of the objective function f(x) at that point? Also, report the number of iterations taken to converge.
In a typical optimization problem (max/min problem), we want to find a relative maximum or relative...
In a typical optimization problem (max/min problem), we want to find a relative maximum or relative minimum of a function. Our process is to • find the derivative of the function, • set that derivative equal to zero, • and solve for x. Use complete sentences to explain why this process makes sense.
General question: how do you find constraints in an optimization problem?
  General question: how do you find constraints in an optimization problem? For example, in this question:"Find two natural numbers whose sum is 16 and whose product is a maximum." the solution states that the constraint is that x would be between 1 and 15. Why not 0? In another example, where the questions asks "The perimeter of a rectangle is 24 cm. Find the dimensions of the rectangle of maximum area. What is the maximum area?", the constraint is...
Suppose an optimization problem is trying to minimize the cost function : Cost = 7S +...
Suppose an optimization problem is trying to minimize the cost function : Cost = 7S + 10R.   The company is producing two products, product S and product R, subject to the following constraints:                                 S + R ≤ 90                         3S + 10R ≥ 620                         R ≤ 100                         S ≥ 20                         S, R ≥ 0 Program this into a blank Excel worksheet and use Solver to find the solution for S and R such that the objective function is...
Solve the following optimization problem. Minimize J = x + 3y + 2z
Solve the following optimization problem. MinimizeJ = x + 3y + 2zsubject to the constraints
Suppose the optimization problem is to minimize the cost of production c = 3 x +...
Suppose the optimization problem is to minimize the cost of production c = 3 x + 4 y subject to the constraint 2xy =337.5. Here the cost-minimizing amount of x is ?? , and y is ?? . The Lagrange multiplier is ?? . The second principal minor of Bordered Hessian is ?? . The bordered Hessian matrix is??
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT