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 44 of the regular model, 32 of the fancy model, and 20 of the super model, and costs $4500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 58 of the super model, and costs $2000 per day to operate. At least 300 of the regular model, 320 of the fancy model, and 680 of the super model are needed. How many days must each plant operate in order to minimize the cost? -Select--- y3---Select-- Select---v F = (objective function) Subject to (regular models) (fancy models) (5|JPOW JJUns)

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 44 of the regular model, 32 of the fancy model, and 20 of the super model, and costs $4500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 58 of the super model, and costs $2000 per day to operate. At least 300 of the regular model, 320 of the fancy model, and 680 of the super model are needed. How many days must each plant operate in order to minimize the cost? -Select--- y3---Select-- Select---v F = (objective function) Subject to (regular models) (fancy models) (5|JPOW JJUns)

Name: Formulate a linear programming problem that can be used to solve the
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: 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 44 of

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

Formulate but do not solve the following exercise as a linear programming problem.National Business Machines manufactures x model A fax machines and y model B fax machines. Each model A cost $120 to make, and each model B costs $150. The profits are $30 for each model A and $30 for each model B fax machine. If the total number of fax machines demanded per month does not exceed 1900 and the company has earmarked not more than $600,000/month for manufacturing costs, how many units of each model should National make each month to maximize its monthly profits P in dollars ? Maximize P = subject to the constraints manufacturing costs number produced x ≥ 0 y ≥ 0
Perth Mining Company operates two mines for the purpose of extracting gold and silver. The Saddle Mine costs $30,000/day to operate, and it yields 50 oz of gold and 3000 oz of silver each of a day The Horseshoe Mine costs $16,000/day to operate, and it yields 75 oz of gold and 1000 oz of silver each of y day. Company management has set a target of at least 650 oz of gold and 18,000 of silver. (a) How many days should each mine be operated so that the target can be met at a minimum cost? The minimum is C - 288000 at (x,y)-(0,18 (b) Suppose C cx + 16,000y. Find the range of values that the Saddle Mine's daily operating cost, the coefficient c of x, can assume without changing the optimal auton SCS (c) Find the range of values that the requirement for gold can assume. s (requirement for gold) s (d) Find the shadow price for the requirement for gold. (Round your answer to the nearest cent.) S
Formulate but do not solve the following exercise as a linear programming problem. A financier plans to invest up to $400,000 in two projects. Project A yields a return of 10% on the investment of x dollars, whereas Project B yields a return of 13% 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 40% of the total investment. How much should she invest in each project to maximize the return on her investment P in dollars? MaximizeP= subject to the constraints ? amount available for investment? allocation of funds?
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 = ---Select--- y = ---Select--- ---Select--- Z |||| ---Select--- | F = AC UB Subject to X ---Select--- 0, y ---Select--- (objective function) (first-class passengers) (tourist passengers) (economy-class passengers) 0, z ---Select--- 0 (nonnegativity constraint)
Use the separation of variables method to solve = Utt, 0 0 U(0, t) = u(2, t) = 0 и (т, 0) — х, и (х,0) — 0
Formulate but do not solve the following exercise as a linear programming problem.. TMA manufactures 37-in. high-definition LCD televisions in two separate locations: Location I and Location II. The output at Location I is at most 5500 televisions/month, whereas the output at Location II is at most 4700 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 2600 and 3700 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. From TMA Location I Location II Minimize TMA will ship x televisions from Location I to City A and y televisions from Location I to City B. Find a shipping schedule that meets the requirements of both companies while keeping costs, C (in dollars), to a minimum.…
Use Excel to solve the linear programming problem.At one of its factories, a manufacturer of televisions makes one or more of four models of HD units (without cases): a 20-in. LCD, a 42-in. LCD, a 42-in. plasma, and a 50-in. plasma. The assembly and testing time requirements for each model are shown in the table, together with the maximum amounts of time available per week for assembly and testing. In addition to these constraints, the supplier of cases indicated that it would supply no more than 290 cases per week and that of these, no more than 40 could be for the 20-in. LCD model.Use the profit for each television shown in the table to find the number of completed models of each type that should be produced to obtain the maximum profit for the week. Find the maximum profit. 20-in. LCD sets 42-in. LCD sets 42-in. plasma sets 50-in. plasma sets profit $ 20-in.LCD 42-in.LCD 42-in.Plasma 50-in.Plasma TotalAvailable Assembly time…
Formulate 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 $3 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 5 min on Machine II. To manufacture a unit of Product B requires 9 min on Machine I and 5 min on Machine II. There are 269 min available on Machine I and 205 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
Q9. A vector function is given by G= 6x² ya, – 5yỷ a, + 2za,. If L is a closed path defined by the sides of a triangle as shown in the figure then, | G• dl equals to 4 Y 1 1 2 Use stoke's theorem 24 7 2 None of these
Formulate but do not solve the following exercise as a linear programming problem.TMA manufactures 37-in. high-definition LCD televisions in two separate locations: Location I and Location II. The output at Location I is at most 6500 televisions/month, whereas the output at Location II is at most 5300 televisions/month. TMA is the main supplier of televisions to Pulsar Corporation, its holding company, which has priority in having all its requirements met. In a certain month, Pulsar placed orders for 3000 and 3600 televisions to be shipped to two of its factories located in City A and City B, respectively. The shipping costs (in dollars) per television from the two TMA plants to the two Pulsar factories are as follows. To Pulsar Factories From TMA City A City B Location I $6 $4 Location II $8 $7 TMA will ship x televisions from Location I to City A and y televisions from Location I to City B. Find a shipping schedule that meets the requirements of both…