OPERATIONS MANAGEMENT (LL) W/CONNECT
14th Edition
ISBN: 9781265502942
Author: Stevenson
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 19, Problem 1P
a)
Summary Introduction
To solve: The linear programming problem and answer the given questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
b)
Summary Introduction
To solve: The linear programming problem and answer the questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
c)
Summary Introduction
To solve: The linear programming problem and answer the questions.
Introduction:
Linear programming:
Linear programming is a mathematical modelling method where a linear function is maximized or minimized taking into consideration the various constraints present in the problem. It is useful in making quantitative decisions in business planning.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
What combination of x and y will yield the optimum for this problem?
Maximize Z = $3x + $15y
Subject to:
Multiple Choice
x= 0, y=4
x= 0, y=3
x= 0, y=0
x= 2y=0
O x=1,y=25
2x + 4y ≤ 12
5x + 2y ≤ 10
For a certain civil engineering system, it is
sought to maximize the benefits, which is given
by the expression: Z=3x+5y.
The decision variables are x (the amount of
resource type 1 to be used) and y (the amount of
resource type 2 to be used).
• The amount of resource type 1 should be at
least 3 units.
• The amount of resource type 2 should be at
least 3 units.
The difference between the amount of
●
resource type 2 and the amount resource type
1 should not exceed 6.
• The total amount of resource types 1 and 2
should not exceed 12 units.
a. Identify the obiective function for this
problem.
b. Identify and write the constraints.
c. Provide a sketch graph for the constraint
set.
d. Clearly show the feasible region.
e. Label all extreme points (or vertices) of the
feasible region and indicate their coordinates.
f. Solve the optimization problem.
6.
A dessert shop plans to purchase a new commercial ice cream maker to replace the old one. They are deciding on two models: Model SUPER costs $3,000 for purchase and $1 in average to make one serving of ice cream. Model PRO costs $5,000 for purchase and a lower cost of $0.8 to make one serving of ice cream. The shop is selling $4 per ice cream serving in average.
What would be the monthly demand (in servings) to make Model PRO more preferred?
Select one:
a.
at least 16,000 servings
b.
no more than 10,000 servings
c.
at least 10,000 servings
d.
model PRO is always preferred.
e.
always no preference.
Chapter 19 Solutions
OPERATIONS MANAGEMENT (LL) W/CONNECT
Ch. 19 - For which decision environment is linear...Ch. 19 - What is meant by the term feasible solution space?...Ch. 19 - Explain the term redundant constraint.Ch. 19 - Prob. 4DRQCh. 19 - Prob. 5DRQCh. 19 - Prob. 6DRQCh. 19 - Prob. 1PCh. 19 - Prob. 2PCh. 19 - Prob. 3PCh. 19 - A small candy shop is preparing for the holiday...
Ch. 19 - A retired couple supplement their income by making...Ch. 19 - Solve each of these problems by computer and...Ch. 19 - Prob. 7PCh. 19 - For Problem 6b: a. Find the range of feasibility...Ch. 19 - Prob. 9PCh. 19 - Prob. 10PCh. 19 - Prob. 11PCh. 19 - The manager of the deli section of a grocery...Ch. 19 - Prob. 13PCh. 19 - A chocolate maker has contracted to operate a...Ch. 19 - Prob. 15PCh. 19 - Prob. 16PCh. 19 - Prob. 1.1CQCh. 19 - Prob. 1.2CQCh. 19 - Prob. 1.3CQCh. 19 - Prob. 2.1CQCh. 19 - Prob. 2.2CQCh. 19 - Prob. 2.3CQCh. 19 - Prob. 2.4CQ
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- The Tinkan Company produces one-pound cans for the Canadian salmon industry. Each year the salmon spawn during a 24-hour period and must be canned immediately. Tinkan has the following agreement with the salmon industry. The company can deliver as many cans as it chooses. Then the salmon are caught. For each can by which Tinkan falls short of the salmon industrys needs, the company pays the industry a 2 penalty. Cans cost Tinkan 1 to produce and are sold by Tinkan for 2 per can. If any cans are left over, they are returned to Tinkan and the company reimburses the industry 2 for each extra can. These extra cans are put in storage for next year. Each year a can is held in storage, a carrying cost equal to 20% of the cans production cost is incurred. It is well known that the number of salmon harvested during a year is strongly related to the number of salmon harvested the previous year. In fact, using past data, Tinkan estimates that the harvest size in year t, Ht (measured in the number of cans required), is related to the harvest size in the previous year, Ht1, by the equation Ht = Ht1et where et is normally distributed with mean 1.02 and standard deviation 0.10. Tinkan plans to use the following production strategy. For some value of x, it produces enough cans at the beginning of year t to bring its inventory up to x+Ht, where Ht is the predicted harvest size in year t. Then it delivers these cans to the salmon industry. For example, if it uses x = 100,000, the predicted harvest size is 500,000 cans, and 80,000 cans are already in inventory, then Tinkan produces and delivers 520,000 cans. Given that the harvest size for the previous year was 550,000 cans, use simulation to help Tinkan develop a production strategy that maximizes its expected profit over the next 20 years. Assume that the company begins year 1 with an initial inventory of 300,000 cans.arrow_forwardIt costs a pharmaceutical company 75,000 to produce a 1000-pound batch of a drug. The average yield from a batch is unknown but the best case is 90% yield (that is, 900 pounds of good drug will be produced), the most likely case is 85% yield, and the worst case is 70% yield. The annual demand for the drug is unknown, with the best case being 20,000 pounds, the most likely case 17,500 pounds, and the worst case 10,000 pounds. The drug sells for 125 per pound and leftover amounts of the drug can be sold for 30 per pound. To maximize annual expected profit, how many batches of the drug should the company produce? You can assume that it will produce the batches only once, before demand for the drug is known.arrow_forwardAssume the demand for a companys drug Wozac during the current year is 50,000, and assume demand will grow at 5% a year. If the company builds a plant that can produce x units of Wozac per year, it will cost 16x. Each unit of Wozac is sold for 3. Each unit of Wozac produced incurs a variable production cost of 0.20. It costs 0.40 per year to operate a unit of capacity. Determine how large a Wozac plant the company should build to maximize its expected profit over the next 10 years.arrow_forward
- Find decision variables, objective function, constraints and non-negativity constraints An auto company manufactures cars and trucks. Each vehicle must be processed in the paint shop and body assembly shop. If the paint shop were only painting trucks, 40 per day could be painted. If the paint shop were only painting cars, 60 per day could be painted. If the body shop were only producing cars, it could process 50 per day. If the body shop were only producing trucks, it could process 50 per day. Each truck contributes $300 to profit and each car contributes $200 to profit. In addition, the auto company can produce at most 30 trucks and 20 cars. The company wants to determine the daily production schedule that will maximize the company’s profit. Formulate the LP model for the problem.arrow_forwardJawad has calculated the possible profits from three different scenarios for the expansion of his restaurant, each for a different amount of advertising and promotion. He has chosen to implement the scenario that offers the greatest profit. Jawad has decided to a. minimin O b. minimnax c. maximax d. maximinarrow_forwardMillie wants to install a new carpet in the living room of her house. She calculated the square footage of the room and then multiplied it by a set cost factor to estimate the cost. This is an example of_________ Group of answer choices Parametric estimating Three-point estimating Bottom-up estimating Analogous estimatingarrow_forward
- Solve the following problem with Excel Solver: (Leave no cells blank be certain to enter "0" wherever required. Do not round intermediate calculations. Round your answers to 2 decimal places.) Maximize Z= 3X+17Y 3X+8Ys 74 3X+11Y ≤ 78 Y s 35 Decision for X Decision for Y Total profit Resource A Resource B Resource C Resources Used Resource A Resource B Resource Carrow_forwardCalculating outcomes as equally likely would BEST describe: O a. Maximax criterion O b. Laplace criterion O c. Regret criterion Od. Maximin criterion Determining the average payoff for each alternative and choosing the one with the BEST payoff is the approach called: ea, maximax O b. minimax regret O c. laplace Od maximin Marrow_forward4. Optimal Rental Decisions in Cloud Computing Assume that AWS has the following 3 options for renting servers. Fraction of Job in one Server Description Rental Low Power Medium Power High Power $2/hr. $4/hr. $9/hr. Hour 1/8 1/6 1/3 L M Note that if you rent a server for less than one hour, you still must pay the rent for the entire hour. You have a job that must finısh in at most 5 hours. The low-power server can finish 1/8th of the job in 1 hour, the medium-power server can finish 1/6 of the job in one hour, and the high- power server can finish 1/3rd of the job in one hour. (a) The typical practice used by most firms is to find a single server that can do the work at the least cost and within the available time. Find the best sıngle server solution-that is, which single server should you use and for how many hours will you rent this server?arrow_forward
- Suppose the following costs for a 10-hour round-trip flight apply to the time frame and expenses of an unscheduled 5-hour charter flight from Baltimore to Las Vegas (and return the next day) on a seven-year-old Boeing 737–800 with 120 occupied seats. Some costs listed in the table have been aggregated up to the flight level from a seat-level decision where they are incurred. Others have been allocated down to the flight level from an entry/exit or maintain-ownership company-level decision. Still other costs vary with the go/no go flight-level decision itself. Your job is to analyze each cost item and figure out the “behavior of cost”—that is, with which decision each cost varies. Fuel and landing fees =$5,200 Quarterly airframe maintenance re: FAA certificate = $1,000 Unscheduled engine maintenance per 10 flight hours =$1,200 Pro rata time depreciation for seventh year of airframe = $7,200 Flight pay for pilots per round-trip flight = $4,200 Long-term hangar facility lease = $6,600…arrow_forwardSolve the linear programming problem by the method of corners. Maximize P= x + 6y subject to x + y s4 2x + y s6 x 2 0, y 20 The maximum is P = at (x, y) = Need Help? Read Itarrow_forwardConsider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,