Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 10.4, Problem 14P
Summary Introduction
Interpretation: The optimal solution for the project is to be achieved using linear programming.
Concept Introduction: Linear programming is a mathematical technique used to achieve the best outcome, given a list of parameters usually restrictions on the resources.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
CREATE A LINEAR PROGRAMMING PROBLEM (1 GRAPHICAL PROBLEM) <OBJECTIVE FUNCTION, STRUCTURAL CONSTRAINT, AND NO NEGATIVE CONSTRAINT> WITH A FULL SOLUTION AND FINAL ANSWER.
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) =
The following diagram represents a flow network. Each edge is labeled with its capacity, the maximum amount of stuff that it can carry.
a. Formulate an algebraic model for this problem as a maximum flow problem.
b. Develop a spreadsheet model and solve this problem. What is the optimal flow plan for this network? What is the optimal flow through the network?
Chapter 10 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 10.2 - Prob. 1PCh. 10.2 - Prob. 2PCh. 10.2 - Prob. 3PCh. 10.2 - Prob. 4PCh. 10.2 - Prob. 5PCh. 10.2 - Prob. 6PCh. 10.3 - Prob. 7PCh. 10.3 - Prob. 8PCh. 10.3 - Prob. 9PCh. 10.3 - Prob. 10P
Ch. 10.4 - Prob. 11PCh. 10.4 - Prob. 12PCh. 10.4 - Prob. 13PCh. 10.4 - Prob. 14PCh. 10.4 - Prob. 15PCh. 10.4 - Prob. 16PCh. 10.5 - Prob. 17PCh. 10.5 - Prob. 18PCh. 10.5 - Prob. 19PCh. 10.5 - Prob. 20PCh. 10.5 - Prob. 21PCh. 10.6 - Prob. 22PCh. 10.6 - Prob. 23PCh. 10.6 - Prob. 24PCh. 10.6 - Prob. 25PCh. 10 - Prob. 26APCh. 10 - Prob. 27APCh. 10 - Prob. 28APCh. 10 - Prob. 29APCh. 10 - Prob. 30AP
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
- Consider the following linear programming problem: Max 3A + 3B s.t 2A + 4B < 12 6A + 4B < 24 A,B > 0 a. Find the optimal solution using the graphical solution procedure. b. If the objective function is changed to 2A + 6B, what will the optimal solution be?arrow_forwardA company produces two products, A and B, which have profits of $9 and $7, respectively. Each unit of product must be processed on two assembly lines, where the required production times are as follows. Hours/Unit Product Line 1 Line 2 A 12 4 B 4 8 Total hours 60 40 a. Formulate a linear programming model to determine the optimal product mix that will maximize profit. b. Transform this model into standard form.arrow_forwardExplain the basic assumptions of the assignment method of linear programming in operations ?arrow_forward
- Maximal Flow a. Write the linear program for this problem. b. Create a spreadsheet model to find the maximal flow from node 1 to 6arrow_forward3. George Heinrich Printing Company wants to schedule the following seven jobs where each job must be processed by two machines A and B, first on machine A and then machine B. The processing times at machine A and B are as follows: Job i 1 2 3 4 5 6 7Processing time on machine A (ai) 15 7 4 7 10 4 7Processing time on machine B (bi) 3 9 10 6 9 5 8 (a) Suppose the inter-arrival times between jobs can be treated as zero and Johnson’srule is used to sequence and process the jobs, what is the completion time of eachjob and what is the total throughput time (makespan) of all jobs? (b) Now suppose that FIFO system (i. e., schedule job l before job 2, etc.) of schedulingand processing the jobs is used. What is the completion time of each job and whatis the total throughput time (makespan) of all jobs? (c) What would be the difference in the average time a job spends in the shop in (a)and (b) above?arrow_forwardSolve 9 a and barrow_forward
- Find Optimal solution for this example (loop) ? ( NOT Initial basic feasible solution )arrow_forwardFind the optimal solution to this linear programming problem. Min 5X + 6Y s.t. 3X + Y ≥ 15 X + 2Y ≥ 13 3X + 2Y ≥ 31 X, Y ≥ 0arrow_forwardA plant has four operators to be assigned to four machines. The time (minutes) required by each worker to produce a product on each machine is shown in the following table: Machine (min.) Operator A B C D 1 10 12 9 11 2 5 10 7 8 3 12 14 13 11 4 8 15 11 9 Determine the optimal assignment and compute total minimum time using the Hungarian’s Method.arrow_forward
- A dispatcher for Citywide Taxi Company has six taxicabs at different locations and five customers who have called for service. The mileage from each taxi’s present location to each customer is shown in the following table: Determine the optimal assignment(s) that will minimize the total mileage traveled.arrow_forwardWrite down linear programming for this assignment problem consistent with the objective of Fix- it Shoparrow_forwardFor the following linear programming problem, determine the optimal solution using the graphical solution method. Max −X + 2Y s.t. 6X − 2Y ≤ 3 −2X + 3Y ≤ 8 X + Y ≤ 3 X, Y ≥ 0 (X, Y) =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 EducationOperations 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 LearningProduction 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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY