Practical Management Science
5th Edition
ISBN: 9781305250901
Author: Wayne L. Winston, S. Christian Albright
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 6, Problem 95P
Summary Introduction
To develop: A linear integer model.
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
Please see attached file.
You 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)
Which of the following statements concerning the transshipment problem is false?
There can be constraints on the number of units shipped into a destination point.
O Any units shipped from one origin point must all go to the same destination point.
O The transshipment problem can be solved with linear programming.
O There can be constraints on the number of units shipped out of an origin point.
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
- Create spreadsheets and use Solver to determine the correct volumes to be produced to minimize cost for the following problem. Your company has two trucks that it wishes to use on a specific contract. One is a new truck the company is making payments on, and one is an old truck that is fully paid for. The new truck’s costs per mile are as follows: 54₵ (fuel/additives), 24₵ (truck payments), 36₵ (driver), 12₵ (repairs), and 1₵ (misc.). The old truck’s costs are 60₵ (fuel/additives), 0₵ (truck payments), 32₵ (rookie driver), 24₵ (repairs), and 1₵ (misc.). The company knows that truck breakdowns lose customers, so it has capped estimated repair costs at $14,000. The total distance involved is 90,000 miles (to be divided between the two trucks).arrow_forwardWhile stars are less common on trees, lights are almost always on trees. Let's suppose that 91% of trees have lights. Describe the distribution of the number of trees with lights in a group of 30 trees. (bonus: shape? How is this shape different than the shape of the # of stars?) Ice89® Describe the distribution of the number of trees you have to see until you see one with lights. Since this is the last one, you can each other's answers. Share With Classarrow_forwardPlease do not give solution in image format thankuarrow_forward
- Deluxe coffee is to be mixed with regular coffee to make at least 54 pounds of a blended coffee. The mixture must contain at least 14 pounds of deluxe coffee. Deluxe coffee costs $7 per pound and regular coffee $6 per pound. How many pounds of each kind of coffee should be used to minimize costs? To attain the minimum cost, use pounds of deluxe coffee and pounds of regular coffee.arrow_forwardModify the warehouse location model as suggested inModeling Issue 2. Specifically, assume that the samefour customers have the same annual shipments, butnow, there are only two possible warehouse locations,each with distances to the various customers. (Thesedistances, along with other inputs, are in the fileP07_27.xlsx.) The company can build either or bothof these warehouses. The cost to build a warehouseis $50,000. (You can assume that this cost has beenannualized. That is, the company incurs a buildingcost that is equivalent to $50,000 per year.) If onlyone warehouse is built, it will ship to all customers. However, if both warehouses are built, then the com-pany must decide which warehouse will ship to each customer. There is a traveling cost of $1 per mile.a. Develop an appropriate model to minimize totalannual cost, and then use Solver to optimize it.Is this model an NLP or an IP model (or both)?b. Use SolverTable with a single input, the traveling costper mile, to see how large…arrow_forwardMinimize 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_forward
- In the PMT function, what is not true about the Num_periods argument? Group of answer choices It reflects a count of how many times payments will be made. It can contain references to fields. You must use constants for this argument. It is required.arrow_forwardIn dealing with a transportation problem, what should be always observed? The demand of the destination should always be larger than the capacity of the source. O The total number of units coming out of a source must not exceed the capacity of the source. The total number of units incoming to the destination must not exceed to the demand of that destination. The capacity of the source should always be greater than the demand.arrow_forwardFlanger is an industrial distributor that sources from hundreds of suppliers. The two modes of transportation available for inbound shipping are LTL (less than truck- load) and TL (truckload). LTL shipping costs $1 per unit, whereas TL shipping costs $500 per truck. Each truck can carry up to 1,000 units. Flanger wants a rule assigning products to shipping mode (TL or LTL) based on annual demand. Each unit costs $50, and Flanger uses a holding cost of 22 percent. Flanger incurs a fixed cost of $150 for each order placed with a supplier. a. Determine a threshold for annual demand above which TL is preferred and below which LTL is preferred. b. How does the threshold change [relative to part (a)] if unit cost is $150 (instead of $50 ) with all other data unchanged? Which mode becomes preferable as unit cost grows? c. How does the threshold change [relative to part (a)] if the LTL cost comes down to $0.8 per unit (instead of $1 per unit)?arrow_forward
- Michael has decided to invest $40,000 in three types of funds. Fund A has projected an annual return of 8 percent, Fund B has projected an annual return of 10 percent, and Fund C has projected an annual return of 9 percent. He has decided to invest no more than 30 percent of the total amount in Fund B and no more than 40 percent of the total amount in Fund C. a. Formulate a linear programming model that can be used to determine the amount of investments Michael should allocate to each type of fund to maximize the total annual return.b. How much should be allocated to each type of fund? What is the total annual return?arrow_forwardA company makes three types of candy and packages them in three assortments. Assortment I contains 4 cherry, 4 lemon, and 12 lime candies, and sells for a profit of $4.00. Assortment Il contains 12 cherry, 4 lemon, and 4 lime candies, and sells for a profit of $3.00. Assortment III contains 8 cherry, 8 lemon, and 8 lime candies, and sells for a profit of $5.00. They can make 5,200 cherry, 4,000 lemon, and 6,000 lime candies weekly. How many boxes of each type should the company produce each week in order to maximize its profit (assuming that all boxes produced can be sold)? What is the maximum profit? Select the correct choice below and fill in any answer boxes within your choice. OA. The maximum profit is $ when boxes of assortment 1. boxes of assortment II and assortment III are produced. OB. There is no way for the company to maximize its profit boxes ofarrow_forwardA person starting in Columbus must visit Great Falls, Odessa, and Brownsville, and then return home to Columbus in one car trip. The road mileage between the cities is shown. Columbus Great Falls Odessa Brownsville Columbus --- 102 79 56 Great Falls 102 --- 47 69 Odessa 79 47 --- 72 Brownsville 56 69 72 --- a)Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit.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,