Consider the following linear program (LP):minimize -2x1 + x2subject toX1+ X2X3= 3X1+ x2X4X1, X2, x3, 4 > 0(a) Write the initial simplex tableau for the artificial LP (ALP) associatedwith this LP.(b) Solve the ALP. Show the optimal tableau and report the optimalsolution and objective value.(c) Indicate the parts of the tableau from part 5b that you would use tostart phase 2 of the simplex method.(d) Convert the tableau from part 5c to one that represents a basic feasiblesolution.(e) Carry out phase 2 of the simplex method on the tableau from part 5d.Show the optimal tableau and write the optimal solution and objective value.

Given minimize -2x1+x2subject to x1+x2-x3=3 x1+x2+x4=6…

Answered: Consider the following linear program…

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

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…
A firm manufactures 2 products A and B. The profits are 5$ and 8$ respectively. The firm has 2 machines and below is the required processing time in hours for each machine on each product. Product A В Machines G 6. 8. H 4 Machine G must be operated for at least 48 hours. Hours Available for machine H is 20 hours. Set up an LP problem to maximize profit and solve it graphically.
Zmax = 3x1 + 7x2 %3D Subject to 2x1 + 3x2< 6 X1 + X2 < 4 X1 2 0, X2 2 0 In the starting simplex tableau, the basic variables are slack variables. The objective value in the next simplex table is
Formulate but do not solve the following exercise as a linear programming problem.A division of the Winston Furniture Company manufactures x dining tables and y chairs. Each table requires 40 board feet of wood and 2 labor-hours. Each chair requires 16 board feet of wood and 4 labor-hours. In a certain week, the company has 2800 board feet of wood available and 560 labor-hours.If the profit for each table is $50 and the profit for each chair is $18, how many tables and chairs should Winston manufacture to maximize its profits P in dollars? Maximize P = subject to the constraints board feet labor-hours x ≥ 0 y ≥ 0
Just make the linear programming model of the next exercise: A company manufactures and sells two lamp models L1 and L2. For its manufacture, a manual work of 30 minutes is needed for the L1 model and 45 minutes for the L2, and a machine work of 25 minutes for L1 and 15 minutes for L2. 150 hours per month are available for manual work and 120 hours per month for the machine. Knowing that profit per unit is $150 and $100 for L1 and L2 respectively, plan production to maximize profit. Please be as clear as possible and show all the steps. Thank you very much
Formulate but do not solve the following exercise as a linear programming problem.A division of the Winston Furniture Company manufactures x dining tables and y chairs. Each table requires 40 board feet of wood and 2 labor-hours. Each chair requires 16 board feet of wood and 5 labor-hours. In a certain week, the company has 2800 board feet of wood available and 500 labor-hours.If the profit for each table is $50 and the profit for each chair is $18, how many tables and chairs should Winston manufacture to maximize its profits P in dollars? Maximize P = subject to the constraints board feet labor-hours x ≥ 0 y ≥ 0
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
Formulate a linear programming problem that can be used to solve the following question. A dealer has 8900 pounds of peanuts, 6000 pounds of almonds, and 3800 pounds of cashews to be used to make two mixtures. The first mixture wholesales for $2.40 per pound and consists of 60% peanuts, 30% almonds, and 10% cashews. The second mixture wholesales for $3.20 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 = ---Select--- y = ---Select--- ---Select--- v|F= Subject to (objective function) (pounds of peanuts) (pounds of almonds) (pounds of cashews) x ---Select--- 0, y ---Select--- 0 (nonnegativity constraint)

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