Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6.6, Problem 36P
Summary Introduction
To solve: The model to minimize the total inches of waste.
Introduction: The variation between the present value of the
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
TRUE OR FALSE
Because the constraints to a linear programming problem are always linear, we can graph them by locating only two different points on the line.
A feasible solution is one that satisfies all the constraints of a linear programming problem simultaneously.
Group startsTrue or False
True, False,
A company produces two products that are processed on two assembly lines. Assembly line 1 has 100 available hours, and assembly line 2 has 42available hours. Each product requires 10 hours of processing time on line 1, while on line 2 product 1 requires 7 hours and product 2 requires 3hours. The profit for product 1 is $6 per unit, and the profit for product 2 is $4 per unit. Formulate a linear programming model for this problem. Solve this model by using graphical analysis.
Chapter 6 Solutions
Practical Management Science
Ch. 6.3 - Prob. 1PCh. 6.3 - Prob. 2PCh. 6.3 - Solve Problem 1 with the extra assumption that the...Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.3 - Prob. 10P
Ch. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.4 - Prob. 14PCh. 6.4 - Prob. 15PCh. 6.4 - Prob. 16PCh. 6.4 - Prob. 17PCh. 6.4 - Prob. 18PCh. 6.4 - Prob. 19PCh. 6.4 - Prob. 20PCh. 6.4 - Prob. 21PCh. 6.4 - Prob. 22PCh. 6.4 - Prob. 23PCh. 6.5 - Prob. 24PCh. 6.5 - Prob. 25PCh. 6.5 - Prob. 26PCh. 6.5 - Prob. 28PCh. 6.5 - Prob. 29PCh. 6.5 - Prob. 30PCh. 6.5 - In the optimal solution to the Green Grass...Ch. 6.5 - Prob. 32PCh. 6.5 - Prob. 33PCh. 6.5 - Prob. 34PCh. 6.5 - Prob. 35PCh. 6.6 - Prob. 36PCh. 6.6 - Prob. 37PCh. 6.6 - Prob. 38PCh. 6 - Prob. 39PCh. 6 - Prob. 40PCh. 6 - Prob. 41PCh. 6 - Prob. 42PCh. 6 - Prob. 43PCh. 6 - Prob. 44PCh. 6 - Prob. 45PCh. 6 - Prob. 46PCh. 6 - Prob. 47PCh. 6 - Prob. 48PCh. 6 - Prob. 49PCh. 6 - Prob. 50PCh. 6 - Prob. 51PCh. 6 - Prob. 52PCh. 6 - Prob. 53PCh. 6 - Prob. 54PCh. 6 - Prob. 55PCh. 6 - Prob. 56PCh. 6 - Prob. 57PCh. 6 - Prob. 58PCh. 6 - Prob. 59PCh. 6 - Prob. 60PCh. 6 - Prob. 61PCh. 6 - Prob. 62PCh. 6 - Prob. 63PCh. 6 - Prob. 64PCh. 6 - Prob. 65PCh. 6 - Prob. 66PCh. 6 - Prob. 67PCh. 6 - Prob. 68PCh. 6 - Prob. 69PCh. 6 - Prob. 70PCh. 6 - Prob. 71PCh. 6 - Prob. 72PCh. 6 - Prob. 73PCh. 6 - Prob. 74PCh. 6 - Prob. 75PCh. 6 - Prob. 76PCh. 6 - Prob. 77PCh. 6 - Prob. 78PCh. 6 - Prob. 79PCh. 6 - Prob. 80PCh. 6 - Prob. 81PCh. 6 - Prob. 82PCh. 6 - Prob. 83PCh. 6 - Prob. 84PCh. 6 - Prob. 85PCh. 6 - Prob. 86PCh. 6 - Prob. 87PCh. 6 - Prob. 88PCh. 6 - Prob. 89PCh. 6 - Prob. 90PCh. 6 - Prob. 91PCh. 6 - Prob. 92PCh. 6 - This problem is based on Motorolas online method...Ch. 6 - Prob. 94PCh. 6 - Prob. 95PCh. 6 - Prob. 96PCh. 6 - Prob. 97PCh. 6 - Prob. 98PCh. 6 - Prob. 99PCh. 6 - Prob. 100PCh. 6 - Prob. 1CCh. 6 - Prob. 2CCh. 6 - Prob. 3.1CCh. 6 - Prob. 3.2CCh. 6 - Prob. 3.3CCh. 6 - Prob. 3.4CCh. 6 - Prob. 3.5CCh. 6 - Prob. 3.6C
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
- A wholesaler is to transport 840 crates of soda from the factory to his shop. He has a lorry which can carry 150 crates at a time and a pick-up which can carry 60 crates at a time. The cost of each journey for the lorry is Shs 25,000 and for the pick-up, it is Shs 20,000. Due to time constraint, the pick-up is to make more journeys than the lorry because it travels faster. He has Shs 250,000 available for transportation. having had the knowledge of linear programming ,advise how he can organize his vehicles to keep the cost as low as possible and state how much he saves by making these journeys.arrow_forwardWe describe the steps involved in solving a simple linear programming model in the contextof a sample problem, that of Puck and Pawn Company, which manufactures hockey sticksand chess sets. Each hockey stick yields an incremental profi t of $2, and each chess set, $4. Ahockey stick requires 4 hours of processing at machine center A and 2 hours at machine centerB. A chess set requires 6 hours at machine center A, 6 hours at machine center B, and 1 hourat machine center C. Machine center A has a maximum of 120 hours of available capacity perday, machine center B has 72 hours, and machine center C has 10 hours.If the company wishes to maximize profi t, how many hockey sticks and chess sets shouldbe produced per day?arrow_forwardSuppose you own 11 bronze coins worth a total of $150,11 silver coins worth a total of $160, and 11 gold coinsworth a total of $170. Develop a linear integer model tofind a combination of coins worth exactly $110arrow_forward
- A famous restaurant in New York is open 24 hours. The six shift periods, the minimum number of servants required at each period, and the hourly cost of hiring one servant at each period are given in the following table. We are interested to find out how many servants are needed to be hired in each shift period. Let Xt represents the number of servants beginning to work in time period t, where t= 1,2,3,4,5,6. Period Time # servant required hourly cost 1 3 am- 7 am 3 $15 2 7 am- 11 am 12 $10 3 11 am- 3 pm 16 $13 4 3 pm – 7 pm 9 $10 5 7 pm – 11 pm 11 $14 6 11 pm – 3 am 4 $10arrow_forwardAn objective function and a system of linear inequalities representing constraints are given. Complete parts a. through c. Objective Function z equals 3 x minus 4 y Constraints left brace Start 3 By 1 Matrix 1st Row 1st Column 2 less than or equals x less than or equals 6 2nd Row 1st Column y greater than or equals 3 3rd Row 1st Column x minus y greater than or equals minus 6 EndMatrix a. Graph the system of inequalities representing the constraints.arrow_forwardFor each of the following constraints, draw a separate graph to show the nonnegative solutions that satisfy this constraint.arrow_forward
- A manufacturer produces bicycles and motorcycles, each of which must be processed through two machine centers. Machine center 1 has a maximum of 120 hours available and machine center 2 has a maximum of 180 hours available. A bicycle requires 6 hours in mc1 and 3 hours in mc2. Manufacturing a motorcycle requires 4 hours in mc1 and 10 hours in mc2. If the profit is $45 for each bicycle and $250 for a motorcycle, determine the number of bicycles and number of motorcycles to produce to maximize profit considering that the number of motorcycles must not exceed 12 units and bicycle must be at least 10 units. Formulate as Linear Program and solve using the graphical Method. Solve using LP-Simplex Solution Maximize Z = 10X1 + 14X2 Subject to: 4x1 + 6x2 <= 24 2x1 + 6x2 <= 20 x1, x2 >= 0arrow_forwardA manufacturer produces bicycles and motorcycles, each of which must be processed through two machine centers. Machine center 1 has a maximum of 120 hours available and machine center 2 has a maximum of 180 hours available. A bicycle requires 6 hours in mc1 and 3 hours in mc2. Manufacturing a motorcycle requires 4 hours in mc1 and 10 hours in mc2. If the profit is $45 for each bicycle and $250 for a motorcycle, determine the number of bicycles and number of motorcycles to produce to maximize profit considering that the number of motorcycles must not exceed 12 units and bicycle must be at least 10 units. Formulate as Linear Program and solve using the graphical Method. Solve using LP-Simplex Solution Maximize Z = 10X1 + 14X2 Subject to: 4x1 + 6x2 <= 24 2x1 + 6x2 <= 20 x1, x2 >= 0 Consider the transportation problem given below. Destinations Source 1 2 3…arrow_forward
arrow_back_ios
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,