Solve the following linear program by the solver method Set Objective:O MaxChanging Variable Cells:To:O MinSubject to the Constraints:O Value of:Make Unconstrained Variables Non-NegativeSelect a SolvingMethod:0AddChangeDeleteReset AllLoad/SaveOptions↑ Maximize:Subject to:12345236789AP = 5x + 4y2x + y = 122x + 3y ≤ 242x +9y2 36x, y20DecisionConstraints123Minimize C:BXCуTotal UsedEFSign AvailableG

Linear Programming is a statistical and mathematical technique used in operations management.…

Answered: Solve the following linear program by…

Business

Operations Management

Solve the following linear program by the solver method

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

Solve the linear programming problem by the method of corners. Minimize C = 6x + 7y subject to 4x + y ≥ 42 2x + y ≥ 30 x + 3y ≥ 30 x ≥ 0, y ≥ 0 The minimum is C = at (x, y) =
Solve the following linear programming problem graphically: Minimize cost = X + 2Y Subject to: X + 3Y ≥ 90 8X + 2Y ≥ 160 3X + 2Y ≥ 120 Y≤ 70
The following table shows the amount spent by four U.S. airlines to fly one available seat 1 mile in the second quarter of 2014. Set up a system and then solve using technology. Airline United Continental American JetBlue Southwest Cost 14.9 14.6 11.9 12.4 Suppose that, on a 3,000 - mile New York to Los Angeles flight, United Continental, American, and Southwest flew a total of 240 empty seats, costing them a total of $100,920. If United Continental had three times as many empty seats as American, how many empty seats did each of these airlines carry on its flight? United Continental empty seats American empty seats Southwest empty seats
Consider the following Integer Linear Program: Minimise: 5x₁ + 4x2 Subject to: X1 X1 3x1 (1) + (iii) X2 4x2 > 6 12 + + X2 ≥ 9 X₁, X2 ≥ 0 and integer Construct the initial tableau for this problem including all decision, slack and artificial variables. You should assume the M-method will be used to solve this, so build the tableau with the objective function coefficients for any artificial variables set to -M. (ii) In the optimal solution to the (non-integer) relaxation of this problem, X₁ and X2 are both basic and the second constraint is a strict inequality. Using any method you like (including computer software), derive the transformation matrix for the optimal solution to the relaxation of this problem, and use it to construct an optimal tableau for the non-integer LP (you can assume that the solution is feasible, so no columns for the artificial variables are needed). From the tableau you derived in (ii) above, use the dual simplex method to find the optimal solution to the integer…
A large manufacturing company is losing three of its existing plants and intends to transfer some employees to three plants that will remain open. The number of employees available for transfer from each closing plant is as follows: Closing plants Available employees 1 60 2 105 3 70 Total 235 The following numbers of employees can be accommodated at the three plants remaining open: Remaining plants Employees required A 45 B 90 с 35 Total 170 Each transferred employee will increase the amount of product produced at each plant, as shown in the following table: From To location location A B с 1 5 8 6 2 10 9 12 3 7 6 8 The company wants to transfer employees to ensure the maximum increase in product output. Solve this problem using the transportation Simplex method (section 2.1) to find the maximum increase in product output and the number of employees transferred between each plant. You must show all working including the intermediate and final tableaux, and provide a summary of your…
Suppose you are planning a road trip (by car) from San Francisco to New York City. You will need to do some research to review distances between the nodes (stops) and the fact that on the way there, you are required to stop in Nashville, Tennessee. Here are other factors to consider when developing your shortest-route: You can only drive at the average speed of 65 MPH The actual driving limit is 9-hour per day You are only allowed to drive during daylight hours Based on your shortest-route model: How many total one-way miles from San Francisco to New York by way of Nashville? How many hours of driving and how many total days? Share a significant take-a-way from this exercise.
Using the Solver Function in Excel to calculate the following: The main challenge is to allocate no more than 140 hours available for play among tables with different pot sizes. Tables with low pot sizes do not generate as much money as those withhigh pot sizes, however the low pot size tables have a greater frequency of play and the hourly expenses are lower because they do not require as much service. The low pot size tables also have a higher house intake (the percentage that the casino takesfrom the players) compared to the high pot tables. There are also restrictions on how manyhours can be allocated to each table. Donald has set a maximum restriction on the number oftables for each pot size for maintenance and security reasons. He has also set a minimum restriction on the number of tables in order to satisfy customer demand. In addition, he has set minimum and maximum restrictions on the number of hours that should be allocated to each table for similar reasons. Given the…
Sunseel Industries produces two types of raw materials, A and B, with a production cost of $4 and $8 per unit, respectively. The combined production of A and B must be at least 700 units per month. The factory is expected to produce at least 400 units of B and not more than 1200 units of A each month. The processing times for A and B are observed to be 5 hours and 4 hours, respectively. A total of 3000 production hours are available per month. Develop a linear program that Sunseel Industries can use to determine the number of units of each raw material to produce that will meet the demand and minimize the total cost.
Malloy Milling grinds calcined alumina to a standard granular size. The mill produces two different size prod regular grind and super grind, from the same raw materials. After reviewing the production rate, demand, and profit for each of the two types of grind, Malloy Milling found the following linear optimization model for profit, where R is the number of tons of regular grind produced and S is the number of tons of super grind produced. Implement the linear optimization model on a spreadsheet and use Solver to find an optimal solution. Interpret the Solver Answer Report, identify the binding constraints, and verify the values of the slack variables. Maximize Profit = 900 R+ 1600 S R+S2700 maximum RS 5+3 5168 R≥400 S≥ 200 Implement the linear optimization model and find an optimal solution. Interpret the optimal solution. The optimal solution is to produce tons of regular grind and tons of super grind. This solution gives the possible profit, which is $ mals rounded to two decimal…
A volunteer has been asked to drop off some supplies at a facility housing victims of a hurricane evacuation. The volunteer would like to bring at least 240 bottles of water, 117 first aid kits, and 83 security blankets on his visit. The relief organization has a standing agreement with two companies that provide victim packages. Company A can provide packages of 21 water bottles, 9 first aid kits, and 7 security blankets at a cost of $3. Company B can provide packages of 8 water bottles, 5 first aid kits, and 3 security blankets at a cost of $2. How many of each package should the volunteer pick up to minimize the cost? What amount does the relief organization pay? Answer Enter the value in the first box and the ordered pair in the second box. Minimum Cost of $ Minimum Cost at Tables Keypad Keyboard Shortcuts
Pierre-Hadrien is a pastry chef in the Parisian restaurant L'Excuse that serves crois-sants and palmiers for breakfast. Pierre-Hadrien needs to work under the daily prod-ucts' constraints imposed by the restaurant's owner. He sets up a linear optimizationproblem to maximize the restaurant's revenue from the sales of croissants and palmiers.Palmiers are sold for $4 each and croissants for $5 each. (Yes, ok, these should be € but let's pretend a French cafe would accept $ for the sake of this exercise.) We assumethat Pierre-Hadrien can sell all the palmiers and croissants he produces. Croissantsand palmiers' production require various quantities of butter, sugar, our and eggs asspecifed in the table below. Palmiers Croissant Total Supplies per day Butter (g) 200 100 15000 Sugar (g) 200 300 25000 Flour (g) 100 200 17000 Eggs (units) 0.4* 0.6* 35 *Note that eggs are in decimals because pastry chefs typically bake the paste formultiple pastries at once. A paste with 3 eggs…
Solver is guaranteed to solve certain types of nonlinear programming models. T/F