(A) Using slack variables, determine the initial system for the linear programming problem(B) Write the simplex tableau and identify the first pivot and the entering and exiting variables(C) Use the simplex method to solve the problemMaximizeP=28x, + 20x2x, +X3 s 12X + 5x s 12X. X2 20subject to(A) Using slack variables, determine the initial system for the linear programming problem Use s for the first constraint and s, for the second constraintFirst constraintSecond constraintObjective functionX. X2. B. 2 0

Answered: Image /qna-images/answer/4b3de6ed-3c82-4f05-97c8-b6c1392dcad3.jpg

Answered: (A) Using slack variables, determine…

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

(A) Using the slack variable, determine the initial system for the linear programming problem. (B) Write the simplex tableau and identify the first pivot and the entering and exiting variables. (C) Use the simplsx method to solve the problem Maximize subject to
Formulate the following problem as a linear programming problem (DO NOT SOLVE): A dietician can purchase an ounce of chicken for $0.25 and an ounce of potatoes for $0.02. Each ounce of chicken contains 13 units of protein and 24 units of carbohydrates. Each once of potatoes contains 5 units of protein and 35 units of carbohydrates. The minimum daily requirements for the patients under the dieticians' care are 45 unites of protein and 50 units of carbohydrates. How many ounces of each type of food should the dietician purchase for each patient so as to minimize costs and at the same time insure the minimum daily requirements of protein and carbohydrates? (Let x1 equal the number of ounces of chicken and x2 the number of ounce of potatoes pruchased per patient)
Formulate a linear programming problem that can be used to solve the following question. An airline has three types of airplanes and has contracted with a tour group to provide transportation for a minimum of 70 first-class, 52 tourist, and 108 economy-class passengers. The first plane costs $4100 for the trip and can accommodate 36 first-class, 16 tourist, and 18 economy-class passengers; the second plane costs $4800 for the trip and can accommodate 8 first-class, 10 tourist, and 42 economy-class passengers; the third plane costs $6300 for the trip and can accommodate 18 first-class, 36 tourist, and 16 economy-class passengers. How many of each type of airplane should be used to minimize the operating cost? x = y = z = F = (objective function) Subject to (first-class passengers) (tourist passengers) (economy-class passengers) x 0, y 0, z 0 (nonnegativity constraint)
ormulate but do not solve the following exercise as a linear programming problem.A company manufactures x units of Product A and y units of Product B, on two machines, I and II. It has been determined that the company will realize a profit of $2 on each unit of Product A and $5 on each unit of Product B. To manufacture a unit of Product A requires 5 min on Machine I and 4 min on Machine II. To manufacture a unit of Product B requires 8 min on Machine I and 5 min on Machine II. There are 286 min available on Machine I and 198 min available on Machine II in each work shift. How many units of a product should be produced in each shift to maximize the company's profit P in dollars? Maximize P = subject to the constraints Machine I Machine II x ≥ 0 y ≥ 0
Solve the linear programming problem by the simplex (y2 - 2x +65 method. Minimize 12x+4y subject to the constraints shown on the right. ys -x+48 1 ys-*+21 y2 -x+9 x20, y20 The minimum value of 12x + 4y is which is attained for x = and y = (Type integers or fractions.)
Formulate but do not solve the following exercise as a linear programming problem.A financier plans to invest up to $600,000 in two projects. Project A yields a return of 9% on the investment of x dollars, whereas Project B yields a return of 14% on the investment of y dollars. Because the investment in Project B is riskier than the investment in Project A, the financier has decided that the investment in Project B should not exceed 35% of the total investment. How much should she invest in each project to maximize the return on her investment P in dollars? Maximize P = subject to the constraints amount available for investment allocation of funds x ≥ 0 y ≥ 0
DIRECTION: Construct the Linear Programming or LP model, then solve. Please show complete, neat and orderly solution. PROBLEM: This time, our immune system is the best defense. With this, a Melagail wishes to mix two types of foods in such a way that the vitamin contents of the mixture contain at least 8 units of vitamin A and 10 units of vitamin C. -Food A contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. -Food B contains 1 unit/kg of vitamin A and 2 units/kg of vitamin C. It costs ₱50 (Philippine peso) per kg to purchase Food A and ₱70 (Philippine peso) per kg to purchase Food B. Formulate this problem as a linear programming problem to minimize the cost of such a mixture.
State the linear programming problem in mathematical terms, identifying the objective function and the constraints. A firm makes products A and B. Product A takes 2 hours each on machine L and machine M; product B takes 2 hours on L and 3 hours on M. Machine L can be used for 14 hours and M for 9 hours Profit on product A is $7 and $6 on B. Maximize profit. OA Maximize 7A+68 Subject to: 2A + 2B < 14 2A+3859 AB20 OC. Maximize 7A-68 Subject to: 2A 20214 3A 28 20 ABSO OB. Maximize 7A 68 Subject to: 2A+28s 14 34 2859 AB20 OD. Maximize 6A+78 Subject to 2A 38 14 2A-2059 A, B20
Solve the linear programming problem by the simplex (y2 - 2x + 41 method. Minimize 10x + 4y subject to the constraints shown on the right. ys -x+36 ys-**14 yz-x+6 x20, y20 The minimum value of 10x + 4y is which is attained for x = (Type integers or fractions.) O and y = D.
Formulate a linear programming problem that can be used to solve the following question. A firm has plants in Boston and Baltimore that manufacture three models of hot tubs: regular, fancy, and super. In one day the Boston plant can manufacture 32 of the regular model, 24 of the fancy model, and 12 of the super model, and costs $2500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 31 of the super model, and costs $2500 per day to operate. At least 312 of the regular model, 360 of the fancy model, and 456 of the super model are needed. How many days must each plant operate in order to minimize the cost? x = ---Select--- y = ---Select--- ---Select--- ✓| F= Subject to X --Select--- 0, y ---Select--- 0 (objective function) (regular models) (fancy models) (super models)
Q2: A/ The Middle East Company manufactures two types of packing tins- red & black. Major production facilities involved are cutting and joining. The cutting department can process 200 red tins or 400 black tins per hour. The joining department can process 400 red tins or 200 black tins per hour. If the contribution towards profit for a red tin is the same as that of a black tin, what is the optimal production level? Formulate a linear programming model for this problem.
e3

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