Practical Management Science
5th Edition
ISBN: 9781305734845
Author: WINSTON
Publisher: Cengage
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 4, Problem 66P
Summary Introduction
To determine: The way Company U can minimize the cost of manufacturing the required steel.
Linear programming:
It is a mathematical modeling procedure where a linear function is maximized or minimized subject to certain constraints. This method is widely useful in making a quantitative analysis which is essential for making important business decisions.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Please see attached file.
A company has one machine which can be used to make product Alpha and product Beta.
Each unit of product Alpha requires 45 minutes of machine time, while
each unit of product Beta requires 37 minutes of machine time.
The machine can be used for 8 hours per day and 5 days per week.
Next week the company will produce 23 units of product Alpha.
After completing the production of Alpha, the company will produce product Beta.
How many units of product Beta can be produced next week?
Use at least 4 decimals.You must showm your calculation steps and brief explanation on your Excel spreadsheets.
green vehicule Inc. manufactures electric cars and small delivery trucks. it has just opened a new factory where the C1 car and the T1 truck can both be manufactured. to make either vehicle, processing in the assembly shop and the paint shop are required. It takes 1/40 of a day and 1/60 of a paint a truck of type T1 and a car of type C1 in the paint shop, respectively. it takes 1/50 of a day to assemble either type of vehicule in the assembly shop. A t1 truck and a C1 car yield profits of $300 and $220, respectively, per vehicule sold
Chapter 4 Solutions
Practical Management Science
Ch. 4.2 - Prob. 1PCh. 4.2 - Prob. 2PCh. 4.2 - Prob. 3PCh. 4.2 - Prob. 4PCh. 4.2 - Prob. 5PCh. 4.2 - Prob. 6PCh. 4.3 - Prob. 7PCh. 4.3 - Prob. 8PCh. 4.3 - Prob. 9PCh. 4.3 - Prob. 10P
Ch. 4.3 - Prob. 11PCh. 4.3 - Prob. 12PCh. 4.4 - Prob. 13PCh. 4.4 - Prob. 14PCh. 4.4 - Prob. 15PCh. 4.4 - Prob. 16PCh. 4.4 - Prob. 17PCh. 4.4 - Prob. 18PCh. 4.4 - Prob. 19PCh. 4.5 - Prob. 20PCh. 4.5 - Prob. 21PCh. 4.5 - Prob. 22PCh. 4.5 - Prob. 23PCh. 4.5 - Prob. 24PCh. 4.5 - Prob. 25PCh. 4.6 - Prob. 26PCh. 4.6 - Prob. 27PCh. 4.6 - Prob. 28PCh. 4.6 - Prob. 29PCh. 4.7 - Prob. 30PCh. 4.7 - Prob. 31PCh. 4.7 - Prob. 32PCh. 4.7 - Prob. 33PCh. 4.7 - Prob. 34PCh. 4.7 - Prob. 35PCh. 4.7 - Prob. 36PCh. 4.7 - Prob. 37PCh. 4.7 - Prob. 38PCh. 4.7 - Prob. 39PCh. 4.7 - Prob. 40PCh. 4.8 - Prob. 41PCh. 4.8 - Prob. 42PCh. 4.8 - Prob. 43PCh. 4.8 - Prob. 44PCh. 4 - Prob. 45PCh. 4 - Prob. 46PCh. 4 - Prob. 47PCh. 4 - Prob. 48PCh. 4 - Prob. 49PCh. 4 - Prob. 50PCh. 4 - Prob. 51PCh. 4 - Prob. 52PCh. 4 - Prob. 53PCh. 4 - Prob. 54PCh. 4 - Prob. 55PCh. 4 - Prob. 56PCh. 4 - Prob. 57PCh. 4 - Prob. 58PCh. 4 - Prob. 59PCh. 4 - Prob. 60PCh. 4 - Prob. 61PCh. 4 - Prob. 62PCh. 4 - Prob. 63PCh. 4 - Prob. 64PCh. 4 - Prob. 65PCh. 4 - Prob. 66PCh. 4 - Prob. 67PCh. 4 - Prob. 68PCh. 4 - Prob. 69PCh. 4 - Prob. 70PCh. 4 - Prob. 71PCh. 4 - Prob. 72PCh. 4 - Prob. 73PCh. 4 - Prob. 74PCh. 4 - Prob. 75PCh. 4 - Prob. 76PCh. 4 - Prob. 77PCh. 4 - Prob. 78PCh. 4 - Prob. 79PCh. 4 - Prob. 80PCh. 4 - Prob. 81PCh. 4 - Prob. 82PCh. 4 - Prob. 83PCh. 4 - Prob. 84PCh. 4 - Prob. 85PCh. 4 - Prob. 86PCh. 4 - Prob. 87PCh. 4 - Prob. 88PCh. 4 - Prob. 89PCh. 4 - Prob. 90PCh. 4 - Prob. 91PCh. 4 - Prob. 92PCh. 4 - Prob. 93PCh. 4 - Prob. 94PCh. 4 - Prob. 95PCh. 4 - Prob. 96PCh. 4 - Prob. 97PCh. 4 - Prob. 98PCh. 4 - Prob. 99PCh. 4 - Prob. 100PCh. 4 - Prob. 101PCh. 4 - Prob. 102PCh. 4 - Prob. 103PCh. 4 - Prob. 104PCh. 4 - Prob. 105PCh. 4 - Prob. 106PCh. 4 - Prob. 107PCh. 4 - Prob. 108PCh. 4 - Prob. 109PCh. 4 - Prob. 110PCh. 4 - Prob. 111PCh. 4 - Prob. 112PCh. 4 - Prob. 113PCh. 4 - Prob. 114PCh. 4 - Prob. 115PCh. 4 - Prob. 116PCh. 4 - Prob. 117PCh. 4 - Prob. 118PCh. 4 - Prob. 119PCh. 4 - Prob. 120PCh. 4 - Prob. 121PCh. 4 - Prob. 122PCh. 4 - Prob. 123PCh. 4 - Prob. 124PCh. 4 - Prob. 125PCh. 4 - Prob. 126PCh. 4 - Prob. 127PCh. 4 - Prob. 128PCh. 4 - Prob. 129PCh. 4 - Prob. 130PCh. 4 - Prob. 131PCh. 4 - Prob. 132PCh. 4 - Prob. 133PCh. 4 - Prob. 134PCh. 4 - Prob. 135P
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
- Seas Beginning sells clothing by mail order. An important question is when to strike a customer from the companys mailing list. At present, the company strikes a customer from its mailing list if a customer fails to order from six consecutive catalogs. The company wants to know whether striking a customer from its list after a customer fails to order from four consecutive catalogs results in a higher profit per customer. The following data are available: If a customer placed an order the last time she received a catalog, then there is a 20% chance she will order from the next catalog. If a customer last placed an order one catalog ago, there is a 16% chance she will order from the next catalog she receives. If a customer last placed an order two catalogs ago, there is a 12% chance she will order from the next catalog she receives. If a customer last placed an order three catalogs ago, there is an 8% chance she will order from the next catalog she receives. If a customer last placed an order four catalogs ago, there is a 4% chance she will order from the next catalog she receives. If a customer last placed an order five catalogs ago, there is a 2% chance she will order from the next catalog she receives. It costs 2 to send a catalog, and the average profit per order is 30. Assume a customer has just placed an order. To maximize expected profit per customer, would Seas Beginning make more money canceling such a customer after six nonorders or four nonorders?arrow_forwardGreen Vehicle Inc. manufactures electric cars and small delivery trucks. It has just opened a new factory where the C1 car and the T1 truck can both be manufactured. To make either vehicle, processing in the assembly shop and in the paint shop are required. It takes 1/40 of a day and 1/60 of a day to paint a truck of type T1 and a car of type C1 in the paint shop, respectively. It takes 1/50 of a day to assemble either type of vehicle in the assembly shop. A T1 truck and a C1 car yield profits of $300 and $220, respectively, per vehicle sold. a) Define the objective function and constraint equations. b) Graph the feasible region. c) What is a maximum-profit daily production plan at the new factory? d) How much profit will such a plan yield, assuming whatever is produced is sold?arrow_forwardPls help ASAP for botharrow_forward
- thec Technologies Corporation (RTC) manufactures two radar models to monitor the speed of missiles. Deluxe model has an accuracy of plus or minus 2 km per hour, whereas standard model has an accuracy of plus or minus 3 km per hour. For the next week, the company has orders for 160 units of deluxe model and 240 units of standard model. Although RTC purchases all the electronic components used in both models, the plastic cases for both models are manufactured at a RTC plant in Chicago. Each deluxe model case requires 4 minutes of injection-molding time and 6 minutes of assembly time. Each standard model case requires 3 minutes of injection-molding time and 8 minutes of assembly time. For next week the Chicago plant has 960 minutes of injection-molding time available and 1728 minutes of assembly time available. The manufacturing cost is $10 per case for deluxe model and $6 per case for standard model. Depending upon demand and the time available at the C plant, RTC occasionally purchases…arrow_forwardA company sells seven types of boxes, ranging in volume from 17 to 33 cubic feet. The demand and size of each box are given as: Box Type 1 | 2 | 3 | 4 | 5 | 6 | 7 Size 33 | 30 | 26 | 24 | 19 | 18 | 17 Demand 400 | 300 | 500 | 700 | 200 | 400 | 200 The variable cost (in dollars) of producing each box is equal to the box's volume. A fixed cost of $1,000 is incurred to produce any quantity of a particular box. If the company desires, demand for any type of box can be satisfied by a box of a larger size. Formulate but do not solve an interger linear program, model to determine the minimum cost of meeting the demand for boxes. Be sure to define your decision variables. Your objective function and constraints must be linear functions; do not multiply decision variables by each other. For the above problem, I'm having some trouble with defining the constraints for a linear integer and would appreciate some assistance.arrow_forwardYou are required to create the following tables in a database named STUDENT_REGISTRATIONS. Ensure that you create the database and table objects exactly as depicted below. STUDENTS STUDENT_ID VARCHAR(8) NOT NULL PRIMARY KEY STUDENT_NAME VARCHAR(40) NOT NULL STUDENT_SURNAME VARCHAR(40) NOT NULL MODULES MODULE_ID VARCHAR(8) NOT NULL PRIMARY KEY MODULE_NAME VARCHAR(40) NOT NULL MODULE_CREDIT SMALLINT NOT NULL STUDENT_MODULES STUDENT_ID VARCHAR(8) NOT NULL PRIMARY KEY FOREIGN KEY REFERENCES STUDENTS(STUDENT_ID) MODULE ID VARCHAR(8) NOT NULL PRIMARY KEY FOREIGN KEY REFERENCES MODULES(MODULE_ID) LECTURERS LECTURER_ID VARCHAR(8) NOT NULL PRIMARY KEY LECTURER_NAME VARCHAR(40) NOT NULL LECTURER_SURNAME VARCHAR(40) NOT NULL O The Independent Institute of Education (Pty) Ltd 2021 Page 3 of 10 19, 20; 21 2021 LECTURER_MODULES MODULE_ID VARCHAR(8) NOT NULL PRIMARY KEY FOREIGN KEY REFERENCES MODULES(MODULE_ID) LECTURER_ID VARCHAR(8) NOT NULL PRIMARY KEY FOREIGN KEY REFERENCES LECTURERS(LECTURER_ID)arrow_forward
- XYZ Inc. produces two types of paper towels, called regular and super-soaker. Regular uses 2 units of recycled paper per unit of production and super-soaker uses 3 units of recycled paper per unit of production. The total amount of recycled paper available per month is 10,000. They also have a binding contract to use at least 8000 units of recycled paper per month with a local pollution control organization. Letting X1 be the number of units of regular produced per month and X2 represent the number of units of super-soaker produced per month, the appropriate constraint/s willI be A) 2X1 + 3X2 > 8000 or 2X1 + 3X2 8000 and 2X1 + 3X2 8000arrow_forward1-18 Katherine D'Ann is planning to finance her college education by selling programs at the football games for State University. There is a fixed cost of $400 for printing these programs, and the variable cost is $3. There is also a $1,000 fee that is paid to the university for the right to sell these programs. If Katherine was able to sell programs for $5 each, how many would she have to sell in order to break even? 1-19 Katherine D'Ann, from Problem 1-18, has become concerned that sales may fall, as the team is on a terrible losing streak and attendance has fallen off. In fact, Katherine believes that she will sell only 500 programs for the next game. If it was possible to raise the selling price of the program and still sell 500, what would the price have to be for Katherine to break even by selling 500?arrow_forwardFRUIT COMPUTER COMPANY Fruit Computer Company manufactures memory chips in batches of ten chips. From past experience, Fruit knows that 80% of all batches contain 10% (1 out of 10) defective chips, and 20% of all batches contain 50% (5 out of 10) defective chips. If a good (that is, 10% defective) batch of chips is sent to the next stage of production, processing costs of $4000 are incurred, and if a bad batch (50% defective) is sent on to the next stage of production, processing costs of $16000 are incurred. Fruit also has the alternative of reworking a batch at a cost of $4000. A reworked batch is sure to be a good batch. Alternatively, for a cost of $400, Fruit can test one chip from each batch in an attempt to determine whether the batch is defective. QUESTIONS 1.Determine a strategy so Fruit can minimize the expected total cost per batch. 2.Compute the EVSI and EVPI.arrow_forward
- Minimize Z= x1+2x2-3x3-2x4 subject to: x1+2x2-3x3+x4=4 x1+2x2+x3+2x4=4 x1, x2, x3,x4 are equal or greater then zeroarrow_forwardA firm makes tow products X and Y and has a total production capacity of 9 tonnes per day, X and Y requiring the same production capacity. The firm has a permanent contract to supply as least 2 tonnes of x and at least 3 tonnes of Y per day to another company. Each tonne of X requires 20 machine-hours production time and each tonne of Y requires 50 machine-hours production time. The daily maximum possible number of machine- hours is 360. All the firm's output can be sold, and the profit made is Rs. 80 per tonne of X and Rs. 120 per tonne of Y. It is required to determine the production schedule for maximum profit and to calculate this profit. Use graphical method to get your solution.arrow_forward4) A printing company makes three grades of wall posters. The better-quality posters sell for Rs. 2.50, intermediate quality for Rs.2.00 and the poorer quality poster for Rs. 1.50. Paper costs Rs. 0.75 for each of the better-quality posters and Rs.0.50 and Rs. 0.25 for each intermediate and poorer quality poster respectively. Because of poor quality paper, the less expensive posters require two minutes of printing time while the other two require 1 minute of printing time only. The department is allocated Rs.150 per day for paper. There are 480 minutes of printing time available daily and each minute that is used to estimate to cost the company Rs. 0.25. In addition, the department incurs a fixed daily cost of Rs. 125, which are not affected by the quantity and quality of papers produced. You are asked to suggest as to how much each type of posters is to produce in order to maximize daily profit?(Don't use excel shortcut solve manually by Simplex LPP method)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,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,