Consider the following linear programming problem.Maximize P = 4x + 5y + 7z subject to the constraints2x + 3y + z ≤ 9003x + y + z ≤ 3504x + 2y+ z ≤ 400x ≥ 0, y ≥ 0, z ≥ 0.(a) Write the linear programming problem as a standard maximization problem.Maximize P = 4x + 5y +7zsubject to2x + 3y +z ≤ 900X3x+y+z4x + 2y + z ≤ 400X ΣΟy≥0Z≥ O(b) Write the initial simplex tableau.≤ 350yZWUPConstant9003504000

Answered: Image /qna-images/answer/a0619e1f-723d-4c5f-bc19-2c8581cbaba2.jpg

Answered: x ≥ 0, y ≥ 0, z ≥ 0. (a) Write the…

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

Solve the linear programming problem. Maximize P = 40x + 50y Subject to 2x+ys 14 x+y ≤ 9 x + 2y ≤ 16 x, y ≥ 0
Solve the linear programming problem. Maximize P = 4x + 4y Subject to 2x+ys 20 x + 2y ≤ 16 x, y 20
Solve the linear programming problem using the simplex method. Maximize P=9x₁ + 2x₂ - X3 subject to X₁ + X2 X3 ≤1 2x₁ +4x2 + 3x3 ≤3 X1, X2, Xз 20
solve the following questions * Q1\ find domain and rang of this function: 1 y = x2- 2 Q2\ find when y = vt3 ,t = Vs2 + 2 s = sinx dx
The supplies, demands, and transportation costs per unit are shown on the network. (a)Develop a linear programming model for this problem; be sure to define the variables in your model. Let x11 = amount shipped from Jefferson City to Des Moines x12 = amount shipped from Jefferson City to Kansas City x13 = amount shipped from Jefferson City to St. Louis x21 = amount shipped from Omaha to Des Moines x22 = amount shipped from Omaha to Kansas City x23 = amount shipped from Omaha to St. Louis Min ???????? s.t. From Jefferson City ?????? From Omaha ??????? To Des Moines ??????? To Kansas City ???????? To St. Louis ???????????? x11, x12, x13, x21, x22, x23 ≥ 0 (b)Solve the linear program to determine the optimal solution. Amount Cost Jefferson City–Des Moines Jefferson City–Kansas City Jefferson City–St. Louis Omaha–Des Moines Omaha–Kansas City Omaha–St. Louis Total
Solve the linear programming problem by the simplex method. Maximize 40x + 30y subject to the following constraints. X + y ≤ 7 + 3y = 12 yz0 - 2x x=0, The maximum value of M is which is attained for x = and y =
A farmer wishes to buy some goats and cows. He has pasture for only 50 animals. Goats cost $300 each and cows $600 each. He can expect to make a profit of $250 on each goat and $350 on each cow. If he has $24000 to spend and he buys g goats and c cows, I. Formulate a linear programming model for this situation. II. Using a graph, find the numbers of goats and cows that will maximize profit. III. State the maximum profit.
Use the simplex method to solve the linear programming problem. z= 5x, +2x2 +X3 4x1 +4x2 + Maximize subject to X3 S36 X1 + 3x2 + 5x3 511 X1 20, X2 20, x3 20. Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. when x, X2 =, x3 = The maximum is and S2 %3D O A. B. There is no maximum.
Q3/ Solve by simplex method the following linear programming problem: (3 tables) Max Z = 3x₁ + 5x₂ + 4x3 Sub.to 2x₂ + 3x₂ ≤8 2x2 + 5x3 ≤ 10 3x + 2x2 + 4x3 ≤ 15 X1, X2, X3 20

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

x ≥ 0, y ≥ 0, z ≥ 0. (a) Write the linear programming problem as a standard maximization problem. P= 4x + 5y +7z Maximize subject to 2x+3y +z ≤ 900 3x+y+z ≤ 350 4x + 2y +z ≤ 400 x ≥ 0 y≥0 Z≥O (b) Write the initial simplex tableau.