You are given 20 cm of wire and 16 cm2 of special paper to make a rectangularbox with a bottom and a lid (The paper is to make the 6 faces of the box,and the wire is to stitch the faces together). Find the dimension of the box tomaximize its volume. All the wire and paper must be used.(a) Formulate the problem as a nonlinear programming problem (NLP).(b) Find the optimal solution, assume that it/they exists.

Answered: Image /qna-images/answer/119082f9-7ee3-4cb4-88b9-b91c33ede76b.jpg

Answered: You are given 20 cm of wire and 16 cm2…

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

In solving maximization problem using simplex method, the optimum column is obtained by getting the column with A. smallest positive value in the Cj - Zj row variables. B. the largest positive value in the Cj - Zj row. C. zero value in the Cj - Zj row. D. the largest negative value in the Cj - Zj row.
this is a linear programming problem. one image is the required information and the other image is the question.
please help me
Write the transportation problem as a linear programming problem in terms and solvent of x and y and solve. (Indicate the number of units that should be transported from each factory to each depot and the total transportation cost.)
Use the simplex method to solve the linear programming problem. Maximize subject to: and X₂= with z = 2x₁ + 9x2 5x₁ + x₂ ≤40 9x1 + 2x₂ ≤60 X₁ + X₂ ≤50 X1, X₂ 20. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum is when x₁ = (Simplify your answers.) B. There is no maximum.
Solve the linear programming problem using the simplex method. Maximize z = 2x₁ +9x2 subject to 5Xq+X, 550 9x1 + 2x2 ≤70 x1 + x2 ≤60 X1, X2 ≥0. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. The maximum is z = when X1 = , X₂ = S1 = , S2 = and S3= B. There is no maximum solution for this linear programming problem.
Use the simplex method to solve the linear programming problem. Maximize 2= 28x1 +7x2 subject to 7x + 4xz s9 X1 + 3x s7 X1 20, x2 20 with Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice O A. The maximum is when x1 = and x2 = (Simplify your answers.) O B. There is no maximum.
For this linear programming problem, formulate the linear programming model. Then, find the optimal solution graphically for the LP with only 2 variables. i.e: Max Z = 500x + 300y Subject to: 4x + 2y <= 60 (1st constraint) 2x + 4y <= 48 (2nd constraint) x, y >= 0 (non-negativity) Problem: Two machines, A and B produce items at the rate of 50 units per hour and 40 units per hour respectively. Under certain production plan, the total number of items needed is at least 1,000 items, the total number of hours available for running the machines is at most 24 hours. If the hourly cost is ₽300 for machine A and ₽250 for machine B, how many hours should each machine be used in order to minimize the cost?
At Long John Silver’s (LJS), Platter 1 comes with 2 pieces of fish, 3 pieces of chicken, and 5 fried shrimp, while Platter 2 comes with 3 pieces of fish, 1 piece of chicken, and 8 fried shrimp. Platter 1 sells for 8 dollars and platter 2 sells for 10 dollars. If LJS has access to 1000 pieces of fish, 1200 pieces of chicken, and 2600 fried shrimp, what is the optimal number of platters LJS should make in order to maximize its profit? Note that the constraints relate to (please use these in order) fish, chicken, and shrimp. Note that problem 7 had three constraints (excluding the non-negativity constraints), and setting two pairs of those constraints to equality led to two extreme points on the feasible region. What INFEASIBLE point was at the intersection of the other pair of constraints? In the optimal solution to problem 7, the optimum was found at the intersection of two of the constraints that were not non-negativity constraints. Call these “binding” constraints. One of those…

Recommended textbooks for you

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Advanced Engineering Mathematics

Advanced Math

ISBN:

9780470458365

Author:

Erwin Kreyszig

Publisher:

Wiley, John & Sons, Incorporated

Numerical Methods for Engineers

Advanced Math

ISBN:

9780073397924

Author:

Steven C. Chapra Dr., Raymond P. Canale

Publisher:

McGraw-Hill Education

Introductory Mathematics for Engineering Applicat…

Advanced Math

ISBN:

9781118141809

Author:

Nathan Klingbeil

Publisher:

WILEY

Mathematics For Machine Technology

Advanced Math

ISBN:

9781337798310

Author:

Peterson, John.

Publisher:

Cengage Learning,

Basic Technical Mathematics

Advanced Math

ISBN:

9780134437705

Author:

Washington

Publisher:

PEARSON

Topology

Advanced Math

ISBN:

9780134689517

Author:

Munkres, James R.

Publisher:

Pearson,

SEE MORE TEXTBOOKS