OPERATIONS MANAGEMENT W/ CNCT+
12th Edition
ISBN: 9781259574931
Author: Stevenson
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 19, Problem 7P
a)
Summary Introduction
To determine: The range of feasibility for each constraint.
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.
Range of feasibility:
It is the range of the values present in the right hand side quantities of a constraint. The shadow prices and variables attained in the solution will remain the same for the right hand side quantities.
b)
Summary Introduction
To determine: The range of optimality for the coefficients of the objective function.
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.
Range of optimality:
It is the range of values at which the coefficient of the objective function of a decision variable will change without changing either the list of the variables in the optimal quantities or the solution.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Al, Barbara, Carol, and Dave have joined together to purchase two season tickets to the Giants’ home football games. Because there are eight home games, each person will get tickets to two games. Each person has ranked the games they prefer from 1 to 8, with 1 being most preferred and 8 least preferred, as follows: Determine the two games each person should get tickets for that will result in the groups’ greatest degree of satisfaction. Do you think the participants will think your allocation is fair?
a. Identify the feasible solution.
b. Obtain the optimal solution.
Note: Assumer or determine the objective function from available data.
Consider the following LP problem: Min 6X+ 18Y; Subject to : 3 X + 9Y <= 47, and X + Y <= 141. Which one of the following is true?:
a.
Slack for each constraint is zero.
b.
Optimal Obj. function value is 94
c.
X=70.5, Y=70.5 is the only optimal solution.
d.
Optimal Obj. function value is 0
Chapter 19 Solutions
OPERATIONS MANAGEMENT W/ CNCT+
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
- Maximize profit = 4X + 4Y Subject to: 3X +5Y ≤ 150 X – 2Y ≤ 10 5X + 3Y ≤ 150 X, Y ≥ 0 Required: a- The corner point method to obtain the optimal point. b- Specify the profit value. c- Calculate the Slack for each constraint and state its formula.arrow_forwardThe High-Price Oil Company owns a pipeline network that is used to convey oil from its source to several storage locations. A portion of the network is as follows: Due to the varying pipe sizes, the flow capacities vary. By selectively opening and closing sections of the pipeline network, the firm can supply any of the storage locations. a. If the firm wants to fully utilize the system capacity to supply storage location 7, how long will it take to satisfy a location 7 demand of 100,000 gallons? What is the maximal flow for this pipeline system? b. If a break occurs on line 2–3 and that line is closed down, what is the maximal flow for the system? How long will it take to transmit 100,000 gallons to location 7?arrow_forwardFormulate a system of equations for the situation below and solve.Cantwell Associates, a real estate developer, is planning to build a new apartment complex consisting of one-bedroom units and two- and three-bedroom townhouses. A total of 204 units is planned, and the number of family units (two- and three-bedroom townhouses) will equal the number of one-bedroom units. If the number of one-bedroom units will be 3 times the number of three-bedroom units, find how many units of each type will be in the complex. one-bedroom units units two-bedroom townhouses units three-bedroom townhouses unitsarrow_forward
- Solve the linear programming problem. (If there is no solution, enter NO SOLUTION.) Minimize z = x + y Subject to 4x + y ≥ 50 x + 4y ≥ 50 x ≤ 23 y ≤ 23 Minimum value is z = at(x, y) = ( , )arrow_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_forwardThe Sav-Us Rental Car Agency has six lots in Nashville, and it wants to have a certain number of cars available at each lot at the beginning of each day for local rental. The agency would like a model it could quickly solve at the end of each day that would tell it how to redistribute the cars among the six lots in the minimum total time. The times required to travel between the six lots are as follows: To (min.) From 1 2 3 4 5 6 1 12 17 18 10 20 2 14 10 19 16 15 3 14 10 12 8 9 4 8 16 14 12 15 5 11 21 16 18 10 6 24 12 9 17 15 The agency would like the following number of cars at each lot at the end of the day. Also, shown is the number of available cars at each lot at the end of a particular day. Determine the optimal reallocation of rental cars. Lot (cars) Cars 1 2 3 4 5 6 Available 37 20 14 26 40 28…arrow_forward
- Note: Provide the complete Linear Programming Model. Show solutions (i.e. decision variables, objective function, subject to constraints, etc.) Question: TLC Corporation wants to increase its sales for the next quarter by promoting its product nationwide. The company has budgeted up to P1,000,000 per month for advertising. The money is to be allocated among four promotional media: TV spots, newspaper ads, and two types of radio advertisements. The company’s goal is to reach the largest possible high potential audience through various media. The following table presents the number of potential customers reached by using an advertisement in each of the four media. It also provides the cost per advertisement placed and the maximum number of ads purchased per month. TLC’s policy requires at least five radio spots to be placed each week. To ensure broad- scoped promotional campaign, management also insists that no more than P400,000 be spent on newspaper advertising every month. MEDIUM…arrow_forwardThe minimum-cost flow problem could be applied_________ Option- 1. by a telephone company attempting to lay out wires in a new housing development. 2. by a forest ranger seeking to minimize the risk of forest fires. 3. None of the choices. 4. by an airline laying out flight routes. 5. All of the choices are correct. Which of the following is not an assumption of a shortest path problem? 1. Associated with each link or arc is a nonnegative number called its length, 2. The objective is to find a shortest path from the origin to the destination. 3. The lines connecting certain pairs of nodes always allow travel in either direction. 4. None of the choices. 5. A path through the network must be chosen going from the origin to the destination.arrow_forwardA linear programming problem is given as follows:min ? = −4?1 + ?2Subject to 8?1 + 2?2 ≥ 164?1 + 2?2 ≤ 12?1 ≤ 6?2 ≤ 4?1, ?2 ≥ 0 I) Find the A, B, C, D, E, F, and G points on the plot below II) Identify the feasible solution area graphically on the following plot (by shading thearea) III) Which points are the extreme points IV) What is the solution of the optimization problem? (x1=?,x2=?,z=?) Show your work V) Which change will make the problem have multiple optimal solutions? If there is more than one answer, choose all.a) Increase of the coefficient of ?1 on the objective function to 4b) Increase of the coefficient of ?1 on the objective function to 2c) Decrease of the coefficient of ?1 on the objective function to -8d) Increase of the coefficient of ?2 on the objective function to -8e) None VI) If new constraints, ?1≤4 and ?2≤6, are added to the given problem, what effect will be? (choose all the effects)a) The feasible solution area will be smaller.b) The feasible solution area will…arrow_forward
- PROBLEM 6 An investment firm has $1 million to invest in stocks, bonds, certificates of deposit, and real estate. The firm wishes to determine the mix of investments that will maximize the cash value at the end of 6 years. Opportunities to invest in stocks and bonds will be available at the beginning of each of the next 6 years. Each dollar invested in stocks will return $1.20 (a profit of $0.20) 2 years later; the return can be immediately reinvested in any alternative. Each dollar invested in bonds will return $1.40 3 years later; the return can be reinvested immediately. Opportunities to invest in certificates of deposit will be available only once, at the beginning of the second year. Each dollar invested in certificates will return $1.80 four years later. Opportunities to invest in real estate will be available at the beginning of the fifth and sixth years. Each dollar invested will return $1.10 one year later. To minimize risk, the firm has decided to diversify its…arrow_forward. Solve each of these problems by computer and obtain the optimal values of the decision variablesand the objective function.a. Maximize Z = 4x1 + 2x2 + 5x3Subject to1x1 + 2x2 + 1x3 ≤ 251x1 + 4x2 + 2x3 ≤ 40 3x1 + 3x2 + 1x3 ≤ 30x1, x2, x3 ≥ 0 b. Maximize Z = 10x1 + 6x2 + 3x3Subject to1x1 + 1x2 + 2x3 ≤ 252x1 + 1x2 + 4x3 ≤ 40 1x1 + 2x2 + 3x3 ≤ 40x1, x2, x3 ≥ 0arrow_forwardThe Janie Gioffre Drapery Company makes three types of draperies at two different locations. At location I, it can make 10 pairs of deluxe drapes, 20 pairs of better drapes, and 13 pairs of standard drapes per day. At location II, it can make 20 pairs of deluxe, 50 pairs of better, and 6 pairs of standard per day. The company has orders for 1000 pairs of deluxe drapes, 2100 pairs of better drapes, and 600 pairs of standard drapes. If the daily costs are $600 per day at location I and $850 per day at location II, how many days should Janie schedule at each location to fill the orders at minimum cost? location I days location II days Find the minimum cost.$arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.