Deck 3: Applications of Linear and Integer Programming Models

Full screen (f)
exit full mode
Question
Nimble Automotive uses linear programming to produce a monthly production schedule for their manufacturing plant.Although the number of cars built is obviously an integer, the fractional part of a non-integer decision variable could be considered "work in progress" at the end of the month.
Use Space or
up arrow
down arrow
to flip the card.
Question
The objective function coefficient for X1 is currently $18 and for X2 is $29, and the ranges of optimality for these coefficients are between $15 and $20 and between $25 and $35, respectively.If the objective function coefficients for X1 and X2 decline by $2 each, since both coefficients are still within their ranges of optimality, the optimal solution is guaranteed to remain the same.
Question
A linear programming model has a constraint that reflects a budget restriction of $100,000.The range of feasibility for this amount, reflected on the sensitivity report, is $85,000 to $325,000.Thus if the budget restriction is changed to $90,000, the optimal solution will not change.
Question
If at most 3 of 7 projects are to be performed, this can be modeled by X1 + X2 + X3 + X4 + X5 + X6 + X7 \le 3, where X1, X2, X3, X4, X5, X6, and X7 are all restricted to be non-negative, have an upper bound of 1, and be integer-valued.
Question
The optimal solution to a supply chain management model can be found by solving the standalone separate components of the process.
Question
Relaxing the integer restrictions to an integer linear model produces an optimal solution of X1 = 23 and X2 = 15.This must also be the optimal solution to the integer linear model.
Question
The optimal solution value of an integer linear programming problem with a minimization objective function may not be __________ the optimal solution value if integer requirements are ignored.

A)the same as
B)less than
C)greater than
D)a rounded form of
Question
Which of the following is true when using summation variables?

A)The number of constraints will stay the same as in a formulation without the use of summation variables.
B)The number of variables will stay the same as in a formulation without the use of summation variables.
C)There are typically fewer non-zero input coefficients on the left side of the constraints.
D)Percentage constraints cannot be formulated without the use of summation variables.
Question
Hong Securities has $300,000 to invest in four stocks and three bonds.X1, X2, X3, and X4 denote the amounts invested in each of the stocks, and Y1, Y2, and Y3 equal the amounts invested in each of the three bonds.Which of the following shows that at least 40% of the investment in stocks must be in stock 1?

A)X1 \ge 120,000
B)X1 - .4X2 -.4X3 - .4X4 \ge 0
C).6X1 - .4X2 - .4X3 - .4X4 \ge 0
D)X1 \ge .4(X2 + X3 + X4 + Y1 + Y2 + Y3)
Question
A maximization integer linear model is solved by first relaxing the integer restrictions, giving an optimal solution to the resulting linear model of X1 = 6, X2 = 11.The shadow price for the first constraint is $9, and the range of feasibility has a maximum increase of 20 and a maximum decrease of 5.Then for the integer model, X1 = 6, X2 = 11 is the optimal solution.If there is an increase of 3 units of the first resource, the optimal value of the objective function will increase by $27.
Question
The shadow price for a constraint that expresses that the availability of wood is 3000 board-feet is $0.50, and the range of feasibility is between 2800 and 4000 board-feet.Which of the following is not correct?

A)All 3000 board-feet of wood will be used.
B)If only 2900 board-feet of wood are available, the optimal objective function value will be reduced by $50.
C)If only 2900 board-feet of wood are available, the optimal solution will not change.
D)If 6000 board-feet of wood are available, the objective function value will increase by at least $500.
Question
It takes two pounds of steel and three pounds of copper to make a particular product.If there are 100 pounds of steel and 100 pounds of cooper available, one constraint will be 2X1 + 3X2 \le 200.
Question
Joe Chan is modeling the installation of smoke alarms.The constraint Y1 - Y2 \ge 0 uses the binary variables Y1 for upstairs installation and Y2 for downstairs installation.The constraint implies that if the first installation is performed, the second must also be performed.
Question
If project 1 is performed then project 2 will not be performed.This can be modeled by the constraint X1 - X2 \le 1, where X1 and X2 are binary variables.
Question
In problem 2, let A = the total amount invested in stocks and B = the total amount invested in bonds.To state that at least 40% of the investment in stocks must be in stock 1, two constraints in the model would be:

A)X1 - .4A \ge 0, X2 + X3 + X4 - A = 0
B)X1 - .4A \ge 0, X1 + X2 + X3 + X4 - A = 0
C)X1 - .4A - .4B \ge 0, A + B = 300,000
D)X1 - .4A - .4B \le 0, A + B = 300,000
Question
In a fixed charge integer linear model where there are variable profits of $45 and $80 for producing products 1 and 2, and a fixed charge of $1000 if any of product 2 is produced, the objective function can be modeled by MAX 45X1 + 80X2 - 1000Y2, where Y2 is a binary variable.
Question
The optimal solution obtained to a maximization integer linear programming model, where the integer requirements are at first ignored, provides a lower bound for the optimal objective function value of the integer model.
Question
One approach for solving an integer linear programming problem is simply to enumerate all feasible points and select the one yielding the "best" value for the objective function.However, the number of feasible integer points is usually so large, even for small problems, that this approach is inefficient for solving most models even with a computer.
Question
A management science professional with extensive modeling experience will focus on management concerns and need not spend much time questioning accountants and front line workers.
Question
You are currently paying $12 per hour for labor, and labor costs are included in the calculation of the objective function coefficients of a maximization problem.The shadow price for labor printed on the sensitivity analysis report is $8.It would be economically beneficial to you if you could secure extra labor for $15 per hour.
Question
Nike may build a factory at Millville (Y1) or it may not.It may also build a regional warehouse at the same site (W1).But Nike will not build a warehouse without also building a factory.So, its choices are: (1) neither factory nor warehouse; (2) factory only; or (3) factory and warehouse.The appropriate linear constraint to express this is:

A)Y1 - W1 \le 1
B)Y1 + W1 \le 1
C)Y1 + W1 \le 0
D)Y1 - W1 \ge 0
Question
Nike will build a factory at Millville or Greenfield, but not both.Alternatively, Nike may choose to build at neither location.The appropriate linear constraint to express this restriction using binary variables Y1 and Y2 is:

A)Y1 - Y2 \le 1
B)Y1 + Y2 \le 1
C)Y1 + Y2 = 1
D)Y1 - Y2 \le 0
Question
Billyboy Toys' toy balls, bats, and gloves net profits, excluding fixed costs, of $7, $8, and $13 respectively.The products require 2, 3, and 5 production hours each.Using current facilities, 1600 production hours are available for the production of these products each month.If Billyboy also leases a second, smaller production facility for $3000 per month, this will increase the availability of production hours for these products by 800.This situation can be modeled using a mixed integer model that includes the following:

A)An objective function of: MAX 7X1 + 8X2 + 13X3 Constraints including: 2X1 + 3X2 + 5X3 \le 2400
Variable constraints including X1, X2, X3 \ge 0
B)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1 Constraints including: 2X1 + 3X2 + 5X3 - 800Y1 \le 2400
Variable constraints including X1, X2, X3= 0, Y1 = 0 or 1
C)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1 Constraints including: 2X1 + 3X2 + 5X3 + 800Y1 \le 1600
Variable constraints including X1, X2, X3 \ge 0, Y1 = 0 or 1
D)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1
Question
What is the difference in the interpretation of reduced cost for an unbounded variable versus a bounded variable?
Question
XLB Sports has 30 franchises (teams).Although most of the teams make an annual profit, some teams report losses.An owner of a team that loses money can still make a profit when he sells the franchise since equity increases have been greater than reported losses.XLB has requested a model to determine which, if any, franchises should be eliminated.The costs associated with team elimination include the buyout of the owner, paying off existing contracts such as ballpark leases, and anticipated legal costs.The objective function is the overall profit of XLB.Because all teams must play on the same day, the number of teams must be an even number.Some teams may lose money at home but help other teams by drawing well in road games. Which of the following is true?

A)Teams reporting a loss should be eliminated.
B)You should use binary variables in a mixed integer model.
C)The problem can be solved by solving 30 team integer linear programming models.
D)The problem cannot be modeled.
Question
Explain the Excel formula SUMIF(F5:F12,"Daily",B5:B12).
Question
Review the Excel spreadsheet below. <strong>Review the Excel spreadsheet below.   Based on the information in the spreadsheet, we can conclude:</strong> A)There may be alternate optimal solutions. B)The range of feasibility for Hours Used Electrical is unlimited. C)For every extra unit of Hours Used Gas, the objective function value will increase by 80. D)The range of optimality for House Inspections is 25 to 29. <div style=padding-top: 35px> Based on the information in the spreadsheet, we can conclude:

A)There may be alternate optimal solutions.
B)The range of feasibility for Hours Used Electrical is unlimited.
C)For every extra unit of Hours Used Gas, the objective function value will increase by 80.
D)The range of optimality for House Inspections is 25 to 29.
Question
The availability of seats for ballgames at Oliver Field is  Bleachers 4000 seats A1 General Admission 10,000 seats A2 Grandstand 10,000 seats A3 Luxury Boxes 1000 seats A4\begin{array} { l r r r } \text { Bleachers } & 4000 \text { seats } & A _ { 1 } & \\\text { General Admission } & 10,000 \text { seats } & A _ { 2 } \\\text { Grandstand } & 10,000 \text { seats } & A _ { 3 } \\\text { Luxury Boxes } & 1000 \text { seats } &A _ { 4 } &\end{array}
A1 through A4 represent the attendance in the different seating options at prices X1, X2, X3, and X4. Better seats must cost at least $1 more than the next lower category. If the team charges $1 per seat, the demand will be 25,000. For each $1 increase in ticket price, the demand drops by 1000. The team owner has set up an integer programming model to maximize revenue (not necessarily to sell out).
What prices should be charged? Is this a linear programming model?
Question
Why use summation variables, which make the linear programming model larger? The model can be completed without summation variables.
Question
You have formulated a problem with three constraints: (1) 2X1 + 3X2 + 4X3 \le 300; (2) X1 + X2 \ge 40; (3) X1 + X2 + X3 = 100.Which of the following states that at least 2 of these 3 constraints must hold? (M = a large value)

A)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 - MY2 \ge 40
X1 + X2 + X3 - MY3 = 100
Y1 + Y2 + Y3 \ge 2
B)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 - MY2 \ge 40
X1 + X2 + X3 + MY3 \ge 100
Y1 + Y2 + Y3 \ge 2
C)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 + MY2 \ge 40
X1 + X2 + X3 - MY3 \le 100
X1 + X2 + X3 + MY3 \ge 100
Y1 + Y2 + Y3 \le 1
D)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 – MY2 \ge 40
X1 + X2 + X3 – MY3 \le 100
Y1 + Y2 + Y3 \le 1

Question
Nike must build a factory at either Millville or Greenfield, but not both.The appropriate linear constraint to express this restriction using binary variables Y1 and Y2 is:

A)Y1 - Y2 \le 1
B)Y1 + Y2 \le 1
C)Y1 + Y2 = 1
D)Y1 - Y2 \le 0
Question
Review this Excel spreadsheet: <strong>Review this Excel spreadsheet:   Based on the figures in the spreadsheet, we can conclude:</strong> A)Atlantic Lighting is included in the optimal result. B)Atlantic Lighting would be included in the optimal result if its objective coefficient were 20.333. C)The range of optimality for Bedrock Insurance is 19.57 to 20.5. D)The range of feasibility for the total expected return is 6980 to 7880. <div style=padding-top: 35px> Based on the figures in the spreadsheet, we can conclude:

A)Atlantic Lighting is included in the optimal result.
B)Atlantic Lighting would be included in the optimal result if its objective coefficient were 20.333.
C)The range of optimality for Bedrock Insurance is 19.57 to 20.5.
D)The range of feasibility for the total expected return is 6980 to 7880.
Question
What is the initial step in the process of building linear models?

A)Define the constraints.
B)Graph the problem.
C)Determine decision variables.
D)Make sure a feasible solution exists.
Question
Marc Leaser, who has a PhD from MIT, has created a process model using first and second order differential equations.He correctly points out that your linear programming model of the same process makes significant simplifying assumptions which make the linear solution suboptimal.What is your reply to management?
Question
Two constraints in a model with binary variables Y1, Y2, Y3 representing whether or not project 1, 2, or 3 will be performed are: Y1 - Y2 \le 0 and Y1 - Y3 \le 0.Taken together, what can be inferred from these constraints?

A)Projects 2 and 3 cannot both be performed.
B)Projects 2 and 3 must be performed if project 1 is performed.
C)Projects 2 and 3 may be performed is project is performed.
D)Project 1 must be performed.
Question
Silver's Gym offers Kickboxing I, Kickboxing II, and Kickboxing III, and Ms.DeVore insists on teaching all three classes.Otherwise, the gym will offer no kickboxing classes.How would you model this constraint?

A)X1 + X2 + X3 = 0
B)X1 + X2 + X3 = 3
C)X1 + X2 + X3 \le 0
D)X1 - X2 = 0 and X1 - X3 = 0
Question
What is wrong with this model? MAXX1+X2X3ST X110X210X310X1X25X1,X2,X30\begin{aligned}\operatorname { MAX } X _ { 1 } + X _ { 2 } - X _ { 3 } & \\\operatorname { ST~X } _ { 1 } & \leq 10 \\X _ { 2 } & \leq 10 \\X _ { 3 } \leq 10 & \\X _ { 1 } - X _ { 2 } & \geq 5 \\X _ { 1 } , X _ { 2 } , X _ { 3 } \geq 0 &\end{aligned}
Question
What is Data Envelopment Analysis?

A)A linear programming based approach to determine the relative efficiency of entities with similar goals and objectives.
B)A decision support system that envelops the entire manufacturing and shipping process into an integrated system.
C)An integer linear programming technique involving solving a series of linear programming models and using the solutions as bounds on the integer solution.
D)A form of sensitivity analysis that allows the simultaneous changing of multiple decision variable values.
Question
Adding a constraint increases the time needed to solve a linear programming model.Why then might adding a summation variable actually improve model efficiency?
Question
Caspian Seafoods has recently purchased a very large property for possible expansion of its business.On this property, Caspian may construct a large plant (X1) or a small plant (X2).In addition, if, and only if, it constructs either plant, it may or may not choose to build a warehouse (X3) as well.That is, no plant also means no warehouse.Caspian has other expansion opportunities as well, and is using binary (0 - 1) programming for evaluation.Write a linear constraint (or constraints) that adequately and appropriately reflects the stated conditions on X1, X2, and X3 under binary programming.
Question
Eastern Engineering Company is trying to decide which of 6 projects to perform during the next quarter.The net present value, the estimated cost, and the number of engineers and staff personnel required for each project are given in the following table.  Project  Net Present Cost  Engineers  Staff  Value ($1000s) Required  Required ($1000s)1100355221456583320095112425018042550025016766954751911\begin{array}{ccccc}\text { Project } & \text { Net Present} & \text { Cost } & \text { Engineers } & \text { Staff }\\ &\text { Value } & \left(\$ 1000^{\prime} s\right) & \text { Required } & \text { Required }\\&(\$ 1000^{\prime} \mathrm{s})\\1 & 100 & 35 & 5 & 2 \\2 & 145 & 65 & 8 & 3 \\3 & 200 & 95 & 11 & 2 \\4 & 250 & 180 & 4 & 2 \\5 & 500 & 250 & 16 & 7 \\6 & 695 & 475 & 19 & 11\end{array}
Eastern has a $550,000 budget and 30 engineers and 15 staff available.Which projects should Eastern perform during the quarter?
Question
Suppose in problem 4, Clancy's Casino pays a wage differential depending on the hours worked.In particular, between midnight and 0700, it pays dealers $16 per hour, between 0700 and 1900 $10 per hour, and between 1900 and midnight $12 per hour.Modify your formulation to problem 4, and determine the minimum cost shift schedule for Clancy's.
Question
X1 is limited to 40% of the total, as modeled by the constraint .6X1 - .4X2 - .4X3 \le 0.Rewrite this as two constraints using a summation variable.
Question
For the Eastern Engineering problem in question 7, suppose the budget is increased to $600,000 and that the additional engineers or additional staff (but not both) can be hired so that only one of the engineer or staff limitations must hold (i.e.at least one of the two constraints holds).Also, if project 2 is performed, project 5 will not be performed, at least two of projects 1, 2, and 3 should be performed, and if project 3 is performed, project 4 should be performed.Which projects should Eastern undertake under these conditions?
Question
Clancy's Casino, in Muledeer, Nevada, is open 24 hours a day, seven days a week.Along with all the other attractions and diversion, Clancy's operates a variety of gaming tables.Dealers at these tables are interchangeable.The casino has the following daily requirements for dealers:  Time  Minimum # of dealers 010005007050009004090013009130017001217002100152100010017\begin{array} { c c } \text { Time } & \text { Minimum \# of dealers } \\0100 - 0500 & 7 \\0500 - 0900 & 4 \\0900 - 1300 & 9 \\1300 - 1700 & 12 \\1700 - 2100 & 15 \\2100 - 0100 & 17\end{array}
A dealer may start work at the beginning of any one of the six shifts and, having begun, works eight consecutive hours.Find the employee schedule that minimizes the total number of dealers required, meeting the minimum level of each shift's requirements.
Question
Kings Department Store has 625 rubies, 800 diamonds, and 700 emeralds from which they will make bracelets and necklaces that they have advertised in their Christmas brochure.Each of the rubies is approximately the same size and shape as the diamonds and the emeralds.Kings will net a profit of $250 on each bracelet, which is made with 2 rubies, 3 diamonds, and 4 emeralds, and $500 on each necklace, which includes 5 rubies, 7 diamonds, and 3 emeralds.How many of each should Kings make to maximize its profit?
Question
Heavenly Casket Company is trying to choose sites for the production of its "mail order" caskets.It is considering plants in Chicago, Dallas, and Atlanta.Finished caskets will then be sent to their two distribution sites in Trenton and Tacoma, which take orders over the internet.Heavenly expects demand of 4000 caskets per year in Trenton and 2500 in Tacoma.The table below gives annual plant capacity, fixed yearly operating expenses, unit production costs, and unit transportation costs between possible plant locations and the distribution sites:  Site  Capacity  Fixed  Annual  Operating  Costs  Production  Cost Per  Unit  Shipping  to Trenton  Shipping  to Tacoma  Chicago 3500$40,000$2007550 Dallas 3200$42,000$1609570 At lanta 3700$45,000$1708298\begin{array}{cccccc}\text { Site } & \text { Capacity } & \begin{array}{c}\text { Fixed } \\\text { Annual } \\\text { Operating } \\\text { Costs }\end{array} & \begin{array}{c}\text { Production } \\\text { Cost Per } \\\text { Unit }\end{array} & \begin{array}{c}\text { Shipping } \\\text { to Trenton }\end{array} & \begin{array}{c}\text { Shipping } \\\text { to Tacoma }\end{array} \\\text { Chicago } & 3500 & \$ 40,000 & \$ 200 & 75 & 50 \\\text { Dallas } & 3200 & \$ 42,000 & \$ 160 & 95 & 70 \\\text { At lanta } & 3700 & \$ 45,000 & \$ 170 & 82 & 98\end{array}
Which plants should be operational, and what should the production quantities and shipping pattern be to minimize Heavenly's annual expenses?
Question
The optimal linear programming solution to the Kings Department Store problem in problem 1 is 131.58 bracelets and 57.89 necklaces.
A.Characterize the (i) rounded off solution; and (ii) the rounded down solution.
B.The shadow price associated with emeralds in the linear programming solution is $13.16, and the upper limit of the range of feasibility for emeralds is 1066.67.A gem buyer at Kings reasoned that since the purchase of emeralds is an included cost, he should be willing to pay up to $13.16 above Kings' current cost for emeralds.When he found a seller who would sell him 100 additional emeralds at $13.00 over the original cost, he purchased them, figuring it would add 100($13.16 - $13.00) = $16 to company profits.He said, "Hey, $16 is $16." Why might he be looking for another job?
Question
Wisconsin State University is planning to advertise its new degree program in Professional Business in several media--television commercials on the local cable station, advertisements in the local community college newspaper, and manning a booth at the county fair.Preliminary estimates are that each television spot will reach 1000 potential students, each newspaper ad will reach 100 potential students, and each day at the county fair will reach 500 potential students.There is a $7500 advertising budget, and the university has negotiated a rate of $825 per ad on the cable station, $85 per ad in the newspaper, and $1150 for a booth at the 3-day county fair.What should be its advertising strategy?
Question
Why use hidden cells in an Excel spreadsheet representation of a linear programming model?
Question
The Data Envelopment Analysis model gives the following equation:  Relative Output Value Relative Input Value \frac {\text { Relative Output Value }} { \text {Relative Input Value } } = 5Y12X1+7Y2+9X2+4X4+3X3\frac{5 Y_{1}}{2 X_{1}}\frac{+7 Y_{2}+9 X_{2}}{+4X_{4}+3 X_{3}}
Create a linear programming model for this DEA problem by converting this equation to a linear objective function and two linear constraints.
Question
Appalachian Coal Company must mine a minimum of 30 tons of coal weekly.It can mine at any of four sites.Relevant data concerning fixed weekly operation costs of the sites, variable mining costs per ton of coal, and estimated maximum weekly output of coal at each site are given in the following table.Formulate a mixed integer programming model and solve for the mining strategy that will minimize total weekly costs.  Site  Weekly Operating  Mining Costs Per  Maximum Weekly  Costs ($1000s) Ton ($1000s) Output (Tons) A$5$1210 B$6$820C$2$1425D$7$615\begin{array}{lccc}\text { Site } & \text { Weekly Operating } & \text { Mining Costs Per } & \text { Maximum Weekly } \\ &\text { Costs }\left(\$ 1000^{\prime} s\right) & \text { Ton }\left(\$ 1000^{\prime} s\right) & \text { Output (Tons) }\\\mathrm{A} & \$ 5 & \$ 12 & 10 \\\mathrm{~B} & \$ 6 & \$ 8 & 20 \\\mathrm{C} & \$ 2 & \$ 14 & 25 \\\mathrm{D} & \$ 7 & \$ 6 & 15\end{array}
Question
An assembly line has 4 stations.All laborers are trained to operate all stations.The union contract limits laborers to a 40 hour work week with no overtime.The company is contracted to produce 320 units per week, with a profit of $1000 per unit.Each unit must proceed through all 4 stations in order.However, there is sufficient work in progress inventory to keep all stations busy at all times.Station information is detailed in the following table:  Station  Time Required Per  cost to Build the  Unit in minutes  Station 115$5000220$8000330$4000420$10,000\begin{array}{lcc}\text { Station } & \text { Time Required Per } & \text { cost to Build the } \\& \text { Unit in minutes } & \text { Station }\\1 & 15 & \$ 5000 \\2 & 20 & \$ 8000 \\3 & 30 & \$ 4000 \\4 & 20 & \$ 10,000\end{array} How many stations of each type does the assembly line require to meet demand?
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/53
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 3: Applications of Linear and Integer Programming Models
1
Nimble Automotive uses linear programming to produce a monthly production schedule for their manufacturing plant.Although the number of cars built is obviously an integer, the fractional part of a non-integer decision variable could be considered "work in progress" at the end of the month.
True
2
The objective function coefficient for X1 is currently $18 and for X2 is $29, and the ranges of optimality for these coefficients are between $15 and $20 and between $25 and $35, respectively.If the objective function coefficients for X1 and X2 decline by $2 each, since both coefficients are still within their ranges of optimality, the optimal solution is guaranteed to remain the same.
False
3
A linear programming model has a constraint that reflects a budget restriction of $100,000.The range of feasibility for this amount, reflected on the sensitivity report, is $85,000 to $325,000.Thus if the budget restriction is changed to $90,000, the optimal solution will not change.
False
4
If at most 3 of 7 projects are to be performed, this can be modeled by X1 + X2 + X3 + X4 + X5 + X6 + X7 \le 3, where X1, X2, X3, X4, X5, X6, and X7 are all restricted to be non-negative, have an upper bound of 1, and be integer-valued.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
5
The optimal solution to a supply chain management model can be found by solving the standalone separate components of the process.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
6
Relaxing the integer restrictions to an integer linear model produces an optimal solution of X1 = 23 and X2 = 15.This must also be the optimal solution to the integer linear model.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
7
The optimal solution value of an integer linear programming problem with a minimization objective function may not be __________ the optimal solution value if integer requirements are ignored.

A)the same as
B)less than
C)greater than
D)a rounded form of
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
8
Which of the following is true when using summation variables?

A)The number of constraints will stay the same as in a formulation without the use of summation variables.
B)The number of variables will stay the same as in a formulation without the use of summation variables.
C)There are typically fewer non-zero input coefficients on the left side of the constraints.
D)Percentage constraints cannot be formulated without the use of summation variables.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
9
Hong Securities has $300,000 to invest in four stocks and three bonds.X1, X2, X3, and X4 denote the amounts invested in each of the stocks, and Y1, Y2, and Y3 equal the amounts invested in each of the three bonds.Which of the following shows that at least 40% of the investment in stocks must be in stock 1?

A)X1 \ge 120,000
B)X1 - .4X2 -.4X3 - .4X4 \ge 0
C).6X1 - .4X2 - .4X3 - .4X4 \ge 0
D)X1 \ge .4(X2 + X3 + X4 + Y1 + Y2 + Y3)
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
10
A maximization integer linear model is solved by first relaxing the integer restrictions, giving an optimal solution to the resulting linear model of X1 = 6, X2 = 11.The shadow price for the first constraint is $9, and the range of feasibility has a maximum increase of 20 and a maximum decrease of 5.Then for the integer model, X1 = 6, X2 = 11 is the optimal solution.If there is an increase of 3 units of the first resource, the optimal value of the objective function will increase by $27.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
11
The shadow price for a constraint that expresses that the availability of wood is 3000 board-feet is $0.50, and the range of feasibility is between 2800 and 4000 board-feet.Which of the following is not correct?

A)All 3000 board-feet of wood will be used.
B)If only 2900 board-feet of wood are available, the optimal objective function value will be reduced by $50.
C)If only 2900 board-feet of wood are available, the optimal solution will not change.
D)If 6000 board-feet of wood are available, the objective function value will increase by at least $500.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
12
It takes two pounds of steel and three pounds of copper to make a particular product.If there are 100 pounds of steel and 100 pounds of cooper available, one constraint will be 2X1 + 3X2 \le 200.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
13
Joe Chan is modeling the installation of smoke alarms.The constraint Y1 - Y2 \ge 0 uses the binary variables Y1 for upstairs installation and Y2 for downstairs installation.The constraint implies that if the first installation is performed, the second must also be performed.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
14
If project 1 is performed then project 2 will not be performed.This can be modeled by the constraint X1 - X2 \le 1, where X1 and X2 are binary variables.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
15
In problem 2, let A = the total amount invested in stocks and B = the total amount invested in bonds.To state that at least 40% of the investment in stocks must be in stock 1, two constraints in the model would be:

A)X1 - .4A \ge 0, X2 + X3 + X4 - A = 0
B)X1 - .4A \ge 0, X1 + X2 + X3 + X4 - A = 0
C)X1 - .4A - .4B \ge 0, A + B = 300,000
D)X1 - .4A - .4B \le 0, A + B = 300,000
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
16
In a fixed charge integer linear model where there are variable profits of $45 and $80 for producing products 1 and 2, and a fixed charge of $1000 if any of product 2 is produced, the objective function can be modeled by MAX 45X1 + 80X2 - 1000Y2, where Y2 is a binary variable.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
17
The optimal solution obtained to a maximization integer linear programming model, where the integer requirements are at first ignored, provides a lower bound for the optimal objective function value of the integer model.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
18
One approach for solving an integer linear programming problem is simply to enumerate all feasible points and select the one yielding the "best" value for the objective function.However, the number of feasible integer points is usually so large, even for small problems, that this approach is inefficient for solving most models even with a computer.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
19
A management science professional with extensive modeling experience will focus on management concerns and need not spend much time questioning accountants and front line workers.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
20
You are currently paying $12 per hour for labor, and labor costs are included in the calculation of the objective function coefficients of a maximization problem.The shadow price for labor printed on the sensitivity analysis report is $8.It would be economically beneficial to you if you could secure extra labor for $15 per hour.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
21
Nike may build a factory at Millville (Y1) or it may not.It may also build a regional warehouse at the same site (W1).But Nike will not build a warehouse without also building a factory.So, its choices are: (1) neither factory nor warehouse; (2) factory only; or (3) factory and warehouse.The appropriate linear constraint to express this is:

A)Y1 - W1 \le 1
B)Y1 + W1 \le 1
C)Y1 + W1 \le 0
D)Y1 - W1 \ge 0
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
22
Nike will build a factory at Millville or Greenfield, but not both.Alternatively, Nike may choose to build at neither location.The appropriate linear constraint to express this restriction using binary variables Y1 and Y2 is:

A)Y1 - Y2 \le 1
B)Y1 + Y2 \le 1
C)Y1 + Y2 = 1
D)Y1 - Y2 \le 0
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
23
Billyboy Toys' toy balls, bats, and gloves net profits, excluding fixed costs, of $7, $8, and $13 respectively.The products require 2, 3, and 5 production hours each.Using current facilities, 1600 production hours are available for the production of these products each month.If Billyboy also leases a second, smaller production facility for $3000 per month, this will increase the availability of production hours for these products by 800.This situation can be modeled using a mixed integer model that includes the following:

A)An objective function of: MAX 7X1 + 8X2 + 13X3 Constraints including: 2X1 + 3X2 + 5X3 \le 2400
Variable constraints including X1, X2, X3 \ge 0
B)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1 Constraints including: 2X1 + 3X2 + 5X3 - 800Y1 \le 2400
Variable constraints including X1, X2, X3= 0, Y1 = 0 or 1
C)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1 Constraints including: 2X1 + 3X2 + 5X3 + 800Y1 \le 1600
Variable constraints including X1, X2, X3 \ge 0, Y1 = 0 or 1
D)An objective function of: MAX 7X1 + 8X2 + 13X3 - 3000Y1
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
24
What is the difference in the interpretation of reduced cost for an unbounded variable versus a bounded variable?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
25
XLB Sports has 30 franchises (teams).Although most of the teams make an annual profit, some teams report losses.An owner of a team that loses money can still make a profit when he sells the franchise since equity increases have been greater than reported losses.XLB has requested a model to determine which, if any, franchises should be eliminated.The costs associated with team elimination include the buyout of the owner, paying off existing contracts such as ballpark leases, and anticipated legal costs.The objective function is the overall profit of XLB.Because all teams must play on the same day, the number of teams must be an even number.Some teams may lose money at home but help other teams by drawing well in road games. Which of the following is true?

A)Teams reporting a loss should be eliminated.
B)You should use binary variables in a mixed integer model.
C)The problem can be solved by solving 30 team integer linear programming models.
D)The problem cannot be modeled.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
26
Explain the Excel formula SUMIF(F5:F12,"Daily",B5:B12).
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
27
Review the Excel spreadsheet below. <strong>Review the Excel spreadsheet below.   Based on the information in the spreadsheet, we can conclude:</strong> A)There may be alternate optimal solutions. B)The range of feasibility for Hours Used Electrical is unlimited. C)For every extra unit of Hours Used Gas, the objective function value will increase by 80. D)The range of optimality for House Inspections is 25 to 29. Based on the information in the spreadsheet, we can conclude:

A)There may be alternate optimal solutions.
B)The range of feasibility for Hours Used Electrical is unlimited.
C)For every extra unit of Hours Used Gas, the objective function value will increase by 80.
D)The range of optimality for House Inspections is 25 to 29.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
28
The availability of seats for ballgames at Oliver Field is  Bleachers 4000 seats A1 General Admission 10,000 seats A2 Grandstand 10,000 seats A3 Luxury Boxes 1000 seats A4\begin{array} { l r r r } \text { Bleachers } & 4000 \text { seats } & A _ { 1 } & \\\text { General Admission } & 10,000 \text { seats } & A _ { 2 } \\\text { Grandstand } & 10,000 \text { seats } & A _ { 3 } \\\text { Luxury Boxes } & 1000 \text { seats } &A _ { 4 } &\end{array}
A1 through A4 represent the attendance in the different seating options at prices X1, X2, X3, and X4. Better seats must cost at least $1 more than the next lower category. If the team charges $1 per seat, the demand will be 25,000. For each $1 increase in ticket price, the demand drops by 1000. The team owner has set up an integer programming model to maximize revenue (not necessarily to sell out).
What prices should be charged? Is this a linear programming model?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
29
Why use summation variables, which make the linear programming model larger? The model can be completed without summation variables.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
30
You have formulated a problem with three constraints: (1) 2X1 + 3X2 + 4X3 \le 300; (2) X1 + X2 \ge 40; (3) X1 + X2 + X3 = 100.Which of the following states that at least 2 of these 3 constraints must hold? (M = a large value)

A)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 - MY2 \ge 40
X1 + X2 + X3 - MY3 = 100
Y1 + Y2 + Y3 \ge 2
B)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 - MY2 \ge 40
X1 + X2 + X3 + MY3 \ge 100
Y1 + Y2 + Y3 \ge 2
C)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 + MY2 \ge 40
X1 + X2 + X3 - MY3 \le 100
X1 + X2 + X3 + MY3 \ge 100
Y1 + Y2 + Y3 \le 1
D)2X1 + 3X2 + 4X3 - MY1 \le 300
X1 + X2 – MY2 \ge 40
X1 + X2 + X3 – MY3 \le 100
Y1 + Y2 + Y3 \le 1

Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
31
Nike must build a factory at either Millville or Greenfield, but not both.The appropriate linear constraint to express this restriction using binary variables Y1 and Y2 is:

A)Y1 - Y2 \le 1
B)Y1 + Y2 \le 1
C)Y1 + Y2 = 1
D)Y1 - Y2 \le 0
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
32
Review this Excel spreadsheet: <strong>Review this Excel spreadsheet:   Based on the figures in the spreadsheet, we can conclude:</strong> A)Atlantic Lighting is included in the optimal result. B)Atlantic Lighting would be included in the optimal result if its objective coefficient were 20.333. C)The range of optimality for Bedrock Insurance is 19.57 to 20.5. D)The range of feasibility for the total expected return is 6980 to 7880. Based on the figures in the spreadsheet, we can conclude:

A)Atlantic Lighting is included in the optimal result.
B)Atlantic Lighting would be included in the optimal result if its objective coefficient were 20.333.
C)The range of optimality for Bedrock Insurance is 19.57 to 20.5.
D)The range of feasibility for the total expected return is 6980 to 7880.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
33
What is the initial step in the process of building linear models?

A)Define the constraints.
B)Graph the problem.
C)Determine decision variables.
D)Make sure a feasible solution exists.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
34
Marc Leaser, who has a PhD from MIT, has created a process model using first and second order differential equations.He correctly points out that your linear programming model of the same process makes significant simplifying assumptions which make the linear solution suboptimal.What is your reply to management?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
35
Two constraints in a model with binary variables Y1, Y2, Y3 representing whether or not project 1, 2, or 3 will be performed are: Y1 - Y2 \le 0 and Y1 - Y3 \le 0.Taken together, what can be inferred from these constraints?

A)Projects 2 and 3 cannot both be performed.
B)Projects 2 and 3 must be performed if project 1 is performed.
C)Projects 2 and 3 may be performed is project is performed.
D)Project 1 must be performed.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
36
Silver's Gym offers Kickboxing I, Kickboxing II, and Kickboxing III, and Ms.DeVore insists on teaching all three classes.Otherwise, the gym will offer no kickboxing classes.How would you model this constraint?

A)X1 + X2 + X3 = 0
B)X1 + X2 + X3 = 3
C)X1 + X2 + X3 \le 0
D)X1 - X2 = 0 and X1 - X3 = 0
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
37
What is wrong with this model? MAXX1+X2X3ST X110X210X310X1X25X1,X2,X30\begin{aligned}\operatorname { MAX } X _ { 1 } + X _ { 2 } - X _ { 3 } & \\\operatorname { ST~X } _ { 1 } & \leq 10 \\X _ { 2 } & \leq 10 \\X _ { 3 } \leq 10 & \\X _ { 1 } - X _ { 2 } & \geq 5 \\X _ { 1 } , X _ { 2 } , X _ { 3 } \geq 0 &\end{aligned}
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
38
What is Data Envelopment Analysis?

A)A linear programming based approach to determine the relative efficiency of entities with similar goals and objectives.
B)A decision support system that envelops the entire manufacturing and shipping process into an integrated system.
C)An integer linear programming technique involving solving a series of linear programming models and using the solutions as bounds on the integer solution.
D)A form of sensitivity analysis that allows the simultaneous changing of multiple decision variable values.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
39
Adding a constraint increases the time needed to solve a linear programming model.Why then might adding a summation variable actually improve model efficiency?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
40
Caspian Seafoods has recently purchased a very large property for possible expansion of its business.On this property, Caspian may construct a large plant (X1) or a small plant (X2).In addition, if, and only if, it constructs either plant, it may or may not choose to build a warehouse (X3) as well.That is, no plant also means no warehouse.Caspian has other expansion opportunities as well, and is using binary (0 - 1) programming for evaluation.Write a linear constraint (or constraints) that adequately and appropriately reflects the stated conditions on X1, X2, and X3 under binary programming.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
41
Eastern Engineering Company is trying to decide which of 6 projects to perform during the next quarter.The net present value, the estimated cost, and the number of engineers and staff personnel required for each project are given in the following table.  Project  Net Present Cost  Engineers  Staff  Value ($1000s) Required  Required ($1000s)1100355221456583320095112425018042550025016766954751911\begin{array}{ccccc}\text { Project } & \text { Net Present} & \text { Cost } & \text { Engineers } & \text { Staff }\\ &\text { Value } & \left(\$ 1000^{\prime} s\right) & \text { Required } & \text { Required }\\&(\$ 1000^{\prime} \mathrm{s})\\1 & 100 & 35 & 5 & 2 \\2 & 145 & 65 & 8 & 3 \\3 & 200 & 95 & 11 & 2 \\4 & 250 & 180 & 4 & 2 \\5 & 500 & 250 & 16 & 7 \\6 & 695 & 475 & 19 & 11\end{array}
Eastern has a $550,000 budget and 30 engineers and 15 staff available.Which projects should Eastern perform during the quarter?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
42
Suppose in problem 4, Clancy's Casino pays a wage differential depending on the hours worked.In particular, between midnight and 0700, it pays dealers $16 per hour, between 0700 and 1900 $10 per hour, and between 1900 and midnight $12 per hour.Modify your formulation to problem 4, and determine the minimum cost shift schedule for Clancy's.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
43
X1 is limited to 40% of the total, as modeled by the constraint .6X1 - .4X2 - .4X3 \le 0.Rewrite this as two constraints using a summation variable.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
44
For the Eastern Engineering problem in question 7, suppose the budget is increased to $600,000 and that the additional engineers or additional staff (but not both) can be hired so that only one of the engineer or staff limitations must hold (i.e.at least one of the two constraints holds).Also, if project 2 is performed, project 5 will not be performed, at least two of projects 1, 2, and 3 should be performed, and if project 3 is performed, project 4 should be performed.Which projects should Eastern undertake under these conditions?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
45
Clancy's Casino, in Muledeer, Nevada, is open 24 hours a day, seven days a week.Along with all the other attractions and diversion, Clancy's operates a variety of gaming tables.Dealers at these tables are interchangeable.The casino has the following daily requirements for dealers:  Time  Minimum # of dealers 010005007050009004090013009130017001217002100152100010017\begin{array} { c c } \text { Time } & \text { Minimum \# of dealers } \\0100 - 0500 & 7 \\0500 - 0900 & 4 \\0900 - 1300 & 9 \\1300 - 1700 & 12 \\1700 - 2100 & 15 \\2100 - 0100 & 17\end{array}
A dealer may start work at the beginning of any one of the six shifts and, having begun, works eight consecutive hours.Find the employee schedule that minimizes the total number of dealers required, meeting the minimum level of each shift's requirements.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
46
Kings Department Store has 625 rubies, 800 diamonds, and 700 emeralds from which they will make bracelets and necklaces that they have advertised in their Christmas brochure.Each of the rubies is approximately the same size and shape as the diamonds and the emeralds.Kings will net a profit of $250 on each bracelet, which is made with 2 rubies, 3 diamonds, and 4 emeralds, and $500 on each necklace, which includes 5 rubies, 7 diamonds, and 3 emeralds.How many of each should Kings make to maximize its profit?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
47
Heavenly Casket Company is trying to choose sites for the production of its "mail order" caskets.It is considering plants in Chicago, Dallas, and Atlanta.Finished caskets will then be sent to their two distribution sites in Trenton and Tacoma, which take orders over the internet.Heavenly expects demand of 4000 caskets per year in Trenton and 2500 in Tacoma.The table below gives annual plant capacity, fixed yearly operating expenses, unit production costs, and unit transportation costs between possible plant locations and the distribution sites:  Site  Capacity  Fixed  Annual  Operating  Costs  Production  Cost Per  Unit  Shipping  to Trenton  Shipping  to Tacoma  Chicago 3500$40,000$2007550 Dallas 3200$42,000$1609570 At lanta 3700$45,000$1708298\begin{array}{cccccc}\text { Site } & \text { Capacity } & \begin{array}{c}\text { Fixed } \\\text { Annual } \\\text { Operating } \\\text { Costs }\end{array} & \begin{array}{c}\text { Production } \\\text { Cost Per } \\\text { Unit }\end{array} & \begin{array}{c}\text { Shipping } \\\text { to Trenton }\end{array} & \begin{array}{c}\text { Shipping } \\\text { to Tacoma }\end{array} \\\text { Chicago } & 3500 & \$ 40,000 & \$ 200 & 75 & 50 \\\text { Dallas } & 3200 & \$ 42,000 & \$ 160 & 95 & 70 \\\text { At lanta } & 3700 & \$ 45,000 & \$ 170 & 82 & 98\end{array}
Which plants should be operational, and what should the production quantities and shipping pattern be to minimize Heavenly's annual expenses?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
48
The optimal linear programming solution to the Kings Department Store problem in problem 1 is 131.58 bracelets and 57.89 necklaces.
A.Characterize the (i) rounded off solution; and (ii) the rounded down solution.
B.The shadow price associated with emeralds in the linear programming solution is $13.16, and the upper limit of the range of feasibility for emeralds is 1066.67.A gem buyer at Kings reasoned that since the purchase of emeralds is an included cost, he should be willing to pay up to $13.16 above Kings' current cost for emeralds.When he found a seller who would sell him 100 additional emeralds at $13.00 over the original cost, he purchased them, figuring it would add 100($13.16 - $13.00) = $16 to company profits.He said, "Hey, $16 is $16." Why might he be looking for another job?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
49
Wisconsin State University is planning to advertise its new degree program in Professional Business in several media--television commercials on the local cable station, advertisements in the local community college newspaper, and manning a booth at the county fair.Preliminary estimates are that each television spot will reach 1000 potential students, each newspaper ad will reach 100 potential students, and each day at the county fair will reach 500 potential students.There is a $7500 advertising budget, and the university has negotiated a rate of $825 per ad on the cable station, $85 per ad in the newspaper, and $1150 for a booth at the 3-day county fair.What should be its advertising strategy?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
50
Why use hidden cells in an Excel spreadsheet representation of a linear programming model?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
51
The Data Envelopment Analysis model gives the following equation:  Relative Output Value Relative Input Value \frac {\text { Relative Output Value }} { \text {Relative Input Value } } = 5Y12X1+7Y2+9X2+4X4+3X3\frac{5 Y_{1}}{2 X_{1}}\frac{+7 Y_{2}+9 X_{2}}{+4X_{4}+3 X_{3}}
Create a linear programming model for this DEA problem by converting this equation to a linear objective function and two linear constraints.
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
52
Appalachian Coal Company must mine a minimum of 30 tons of coal weekly.It can mine at any of four sites.Relevant data concerning fixed weekly operation costs of the sites, variable mining costs per ton of coal, and estimated maximum weekly output of coal at each site are given in the following table.Formulate a mixed integer programming model and solve for the mining strategy that will minimize total weekly costs.  Site  Weekly Operating  Mining Costs Per  Maximum Weekly  Costs ($1000s) Ton ($1000s) Output (Tons) A$5$1210 B$6$820C$2$1425D$7$615\begin{array}{lccc}\text { Site } & \text { Weekly Operating } & \text { Mining Costs Per } & \text { Maximum Weekly } \\ &\text { Costs }\left(\$ 1000^{\prime} s\right) & \text { Ton }\left(\$ 1000^{\prime} s\right) & \text { Output (Tons) }\\\mathrm{A} & \$ 5 & \$ 12 & 10 \\\mathrm{~B} & \$ 6 & \$ 8 & 20 \\\mathrm{C} & \$ 2 & \$ 14 & 25 \\\mathrm{D} & \$ 7 & \$ 6 & 15\end{array}
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
53
An assembly line has 4 stations.All laborers are trained to operate all stations.The union contract limits laborers to a 40 hour work week with no overtime.The company is contracted to produce 320 units per week, with a profit of $1000 per unit.Each unit must proceed through all 4 stations in order.However, there is sufficient work in progress inventory to keep all stations busy at all times.Station information is detailed in the following table:  Station  Time Required Per  cost to Build the  Unit in minutes  Station 115$5000220$8000330$4000420$10,000\begin{array}{lcc}\text { Station } & \text { Time Required Per } & \text { cost to Build the } \\& \text { Unit in minutes } & \text { Station }\\1 & 15 & \$ 5000 \\2 & 20 & \$ 8000 \\3 & 30 & \$ 4000 \\4 & 20 & \$ 10,000\end{array} How many stations of each type does the assembly line require to meet demand?
Unlock Deck
Unlock for access to all 53 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 53 flashcards in this deck.