28. If the objective function is to Max Z=2x+3y, what will be the optimal solution asshown below?(0.5)(0,4)(6/11, 40/11)A. (3,1.5)B. (4,0)C. (6,0)D. (2,2)Feasible Region(2.0)

Answered: Image /qna-images/answer/5b2d8dc8-45a3-43bd-95f8-294dc0c7b4f0.jpg

Answered: 28. If the objective function is to Max…

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

What is the reason for the d) answer? I cannot understand it. Please, if possible visualize why it is correct.
Use the simplex method to find x, 20 and x, 2 0 such that Xq + 4x2 2 26 Xq + X2546 and such that z = 12x, + 10x, is maximized. The maximum is z= when x1 and x2 %3D
Find the multiple solutions.Maximize z = 45x1 + 30x2, subject to 2x1 + 9x2 ≤ 144 2x1 + 3x2 ≤ 60 3x1 + 2x2 ≤ 75 x1 ≥ 0, x2 ≥ 0 z = at ( , 0), ( , ), and on the line segment between.
3. Suppose that a Pizza Store revenues about 20,000r pesos when employing y clerks. Let P be the weekly profit function (in pesos) of the store, which is given by P(r, y) = 3,000 + 240y + 20y(x – 2y) – 10(r – 12)*. What should be the number of clerks and their collected revenue to obtain the greatest profit? If the profit function is constrained by the equation 61x – y = 6133, is there still any profit? Justify your answer.
Raggs, Ltd. a clothing firm, determines that in order to sell x suits, the price per suit must be p = 130-0.75x. It also determines that the total cost of producing x suits is given by C(x)=3000+ 0,5x² a) Find the total revenue, R(x). b) Find the total profit, P(x). c) How many suits must the company produce and sell in order to maximize profit? d) What is the maximum profit? e) What price per suit must be charged in order to maximize profit?
Find the optimal solution: Zmax = 8x1 + 7x2 Subject to: 3x1 + X2 s 66 X1 + X2 s 45 X1 s 20, x2 s 40 X1, X2 2 0
4. The financial department of a hospital arrived at the cost function: C(x)=20x³ -360x² +2300x-1000, 1≤x≤12. C(x) is the cost in thousands of dollars for handling x thousand cases per month. Determine the minimum average cost of the hospital, and give the number of cases per month needed to produce a minimum average cost. Round all answers to the nearest thousands. Draw a picture of your friendly window. 2100
Sketch the following problem graphically: max f = x2 X2 subject to g1 = X1 – (1 – x2)³ < 0 92 = x1 2 0 Find the solution graphically. Apply the optimality conditions and monotonicity rules. Discuss. (From Kuhn & Tucker, 1951.)
I put an example of how they want it to be solved from the program.

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

28. If the objective function is to Max Z=2x+3y, what will be the optimal solution as shown below? (0.4) (6/11, 40/11) A. (3,1.5) B. (4,0) C. (6,0) D. (2,2) Feasible Region (2.0)