Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative.Maximize f = 9x +9y subject to8x + 5y s 400x + 2y s 200.XNeed Help?Submit Answer$1Read It52Watch tMaster it4first constraintsecond constraintobjective function

The problem is converted to canonical form by adding slack, surplus . 1. As the constraint-1 is of…

Answered: Set up the simplex matrix used to solve…

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

Write the equations for the objective function and the constraint. Use and show all the calculus that proves your answer. A rectangle pen is built with one side against a barn. No fencing is needed against the barn. Three hundred fifty meters of fencing are used for the other three sides of the pen. What dimensions maximize the area of the pen?
A company produces two types of drills, a cordless model and a corded model. The cordless model requires 3 hours, and the corded-type drill requires 1 hours to make. The company has 180 work hours per day for manufacturing. The factory has space for storage of 140 drills per day. Let z = the number of cordless drills produced per day and y = the number of corded drills produced per day. Write the system of inequalities for these constraints: Assembly: 3x + y Storage: x+y 250+ 240 230- 220- 210- 200 Graph the feasible region for this system of inequalities. Note: To get the correct feasible region, you need to also include the non-negative constraints on your graph (≥0 and y ≥ 0). These will give you boundary lines on the x-axis and y-axis. 190 180 170- 160- 150 140 130 120 110- 100 90- 688888888 80 70 60- 50- 40- 30 20- 10 <180 <140 Clear All Draw: 10 20 30 40 50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 200 210 220 230 240 250
Is this constraint linear or able to be included as a constraint in a linear programming problem? 3X12 + 7X2 ≤ 45 True False
Formulate a linear programming problem that can be used to solve the following question. A dealer has 7100 pounds of peanuts, 6600 pounds of almonds, and 4200 pounds of cashews to be used to make two mixtures. The first mixture wholesales for $2.20 per pound and consists of 65% peanuts, 30% almonds, and 5% cashews. The second mixture wholesales for $3.30 per pound and consists of 15% peanuts, 45% almonds, and 40% cashews. How many pounds of each mixture should the dealer make to maximize revenue? x= number of pounds of the first mature v y number of pounds of the second ture ✔ Maximi O✓ F- Subject to 0. y. (objective function) (pounds of peanuts) (pounds of almonds) (pounds of cashews) ✓0 (nonnegativity constraint)
Use the method of linear programming to solve the problem. A craftswoman produces two products: floor lamps and table lamps. Production of one floor lamp requires 75 minutes of her labor and materials that cost $25. Production of one table lamp requires 50 minutes of labor, and the materials cost $20. The craftswoman wishes to work no more than 40 hours each week (2400 minutes each week), and her financial resources allow her to pay no more than $900 for materials each week. If she can sell as many lamps as she can make and if her profit is $39 per floor lamp and $33 per table lamp, how many floor lamps and how many table lamps should she make each week to maximize her weekly profit? What is the maximum profit? Step 4: Graph the region of possible solutions (by finding the x and y intercepts for each inequality, or any two points for vertical and horizontal inequalities.).
Sometimes in linear programming, if the problem calls for it, it might be necessary to multiply two decision variables together to form a constraint. Ex. 1 X 2 20 True False
Solve the linear programming problem. What is the maximum value of P? Maximize Select the correct choice below and fill in any answer boxes present in your choice. P= 30x + 40y O A. P= (Type an integer or a fraction.) Subject to 2x +y s 14 O B. There is no maximum value of P. x+y s 8 x+2y s 12 х, у 20
Use the dual simplex algorithm in order to find a solution if the constraint x1 <= 2 is added
Please solve this
Which of the following is not true about linear programming? The value of the variables can be negative. The objective is either to maximize or to minimize. The relationship between variables can be expressed in equations or inequalities. The actions are constrained.
An investor has $621,000 to invest in bonds. Bond A yields an average of 8% and the bond B yields 7%. The investor requires that at least 5 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. This can be set up as a linear programming problem. Introduce the decision variables: x= dollars invested in bond Ay= dollars invested in bond B Compute x+y. $ . Round to the nearest cent. Investor Matt has $152,000 to invest in bonds. Bond A yields an average of 9.2% and the bond B yields 8.4%. Matt requires that at least 4 times as much money be invested in bond A as in bond B. You must invest in these bonds to maximize his return. What is the maximum return? $ per year. Round to the nearest cent. Investor Dan has $607,000 to invest in bonds. Bond A yields an average of 8.5% and the bond B yields 8.4%. Dan requires that at least 4 times as much money be invested in bond A as in…
Linear Programming Please solve handwritten

SEE MORE QUESTIONS

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

Set up the simplex matrix used to solve the linear programming problem. Assume all variables are nonnegative. Maximize f = 9x + 9y subject to 8x + 5y s 400 x + 2y s 200. X Need Help? 51 Read It 52 Watch t Master it first constraint second constraint objective function