Deck 17: Appendix: Modeling Using Linear Programming

Full screen (f)
exit full mode
Question
A company has normal capacity for 2,500 units a month. If, x11 and x21 represent the production decisions variables, which of the following equations represents the occurrence of change?

A) x11 + x21 − 2500
B) x11 − x21 − 2500
C) x12 − x21 − 2500
D) x12 + x21 − 2500
Use Space or
up arrow
down arrow
to flip the card.
Question
Excel Solver can handle basic linear programming but not the special transportation problem.
Question
If a company has a demand of 1,600 units for the month of May and a beginning of 900 units, and if Xm = production in May and Lm = the number of lost sales in May, which of the following equations represents the material-balance constraint?

A) Xm - Im + 900 + Lm = 1,600
B) Xm + Im - 900 + Lm = 1,600
C) Xm - Im + 900 - Lm = 1,600
D) -Xm - Im + 900 - Lm = 1,600
Question
Which of the following factors would generally NOT be part of a linear programming model for blending?

A) Revenue
B) Cost
C) Product/component specifications
D) Supply = demand
Question
The total project cost can be minimized by minimizing crash costs.
Question
The constraint x1 and x2 \ge 0 refers to:

A) feasibility.
B) maximization.
C) binding.
D) nonnegativity.
Question
Any particular combination of decision variables is referred to as a(n) _____.

A) objective
B) solution
C) constraint
D) coefficient
Question
A company is considering a rate change, either an increase or a decrease in production, where Xt = production in a time period; Rt = increase in production rate from Period t−1 to Period t; Dt = decrease in production rate from Period t−1 to Period t. Which of the following is correct?

A) Xt − Xt - 1 = Dt − Rt
B) Xt - 1 − Xt = Dt − Rt
C) Xt - 1 − Xt = Rt − Dt
D) Xt − Xt - 1 = Rt − Dt
Question
Since price is usually set by market conditions, the blending problem's use of linear programming attempts to meet the demand at a minimum cost.
Question
For linear programming to work for project crashing decisions, a dummy activity is needed at the beginning of the project, with a duration of zero (0) time.
Question
Deciding on how much of each grade of gasoline to produce is an example of the linear programming model for blending applications.
Question
The term 'programming' is used in linear programming because these models find the best 'program' or course of action to follow.
Question
The constraint that requires the ending inventory from previous month plus current production minus ending inventory of this month equals this month's demand is known as a demand requirement.
Question
If Rm = increase in the total production level during month 'm' compared to month m-1 and Dm = decrease in the total production level during month 'm' compared to month m-1, which of the following statements can be correct?

A) Rm = Dm = 0.
B) Both Rm and Dm are positive.
C) Both Rm and Dm are negative.
D) One variable can be positive and the other negative.
Question
If a single variable is used to represent the change in production level, only positive changes would be permitted, because of the nonnegativity requirement.
Question
Which of the following factors would generally NOT be part of a linear programming model for production scheduling?

A) Fluctuations in production
B) Inventory levels
C) Waiting time probability distributions
D) Storage capacity
Question
Constant terms in the objective function are called objective function _____.

A) variables
B) decisions
C) coefficients
D) constraints
Question
Solutions to a linear programming model that satisfy all constraints are referred to as optimal.
Question
In production scheduling, (ending inventory from the previous month) + (current production)-(ending inventory this month) = _____.

A) production rate change
B) this month's demand
C) amount of overtime/undertime
D) next month's inventory
Question
The transportation problem is a special type of linear programming that arises in planning the distribution of goods and services from only one supply point to several demand locations.
Question
If Activity C directly precedes both D and E on a project network, and C can be crashed three (3) times using linear programming, then:

A) crash time affects only C.
B) crash time affects only C and D.
C) crash time affects only C and E.
D) crash time affects both D and E.
Question
A cement company has three factories that they identify as Alpha, Beta, and Gamma. They supply cement to three warehouses referred to as X, Y, and Z. The company wants to determine how much cement should be shipped from each factory to each warehouse to minimize shipping costs. The cost to ship each 100-pound bag, along with warehouse requirements and factory capacities in bags are shown in the table below:
A cement company has three factories that they identify as Alpha, Beta, and Gamma. They supply cement to three warehouses referred to as X, Y, and Z. The company wants to determine how much cement should be shipped from each factory to each warehouse to minimize shipping costs. The cost to ship each 100-pound bag, along with warehouse requirements and factory capacities in bags are shown in the table below:   a. How many decision variables are there in this problem? b. What is (are) the constraint(s) corresponding to factory Alpha? c. How many constraints are required for this problem?<div style=padding-top: 35px>
a. How many decision variables are there in this problem?
b. What is (are) the constraint(s) corresponding to factory Alpha?
c. How many constraints are required for this problem?
Question
The precedence relationships in a network limit the activity _____.

A) nonnegativity time
B) overtime
C) crash time
D) inventory time
Question
A food processing company makes meatloaf to be sold in the frozen food section of supermarkets.Each week, the recipe used changes based on the current cost of ingredients. Ingredients and current costs are as shown below:
 Ingredient  Cost/pound  pork $2.87 hamburger $1.63 wheat filler $0.22 corn filler $0.16\begin{array}{ll}\text { Ingredient }&\text { Cost/pound }\\\text { pork } & \$ 2.87 \\\text { hamburger } & \$ 1.63 \\\text { wheat filler } & \$ 0.22 \\\text { corn filler } & \$ 0.16\end{array}
For each batch made, at least 300 pounds of pork and 100 pounds of hamburger are required. No more than 200 pounds of wheat filler can be used per batch, and the amount of corn filler has to range between 50 and 150 pounds. Moreover, each batch must contain at least 500 pounds of meat and no more than 200 pounds of filler.
a. What is the objective function if the company seeks to minimize costs?
b. If x1 is the amount of pork used, what are the constraints associated with it?
c. If x3 is the amount of wheat filler used, what are the constraints associated with it?
Question
A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its manufacturing facilities to three regional warehouses. It is thinking about using a transportation LP formulation to exactly matched capacities and requirements. Data on transportation costs (in dollars per unit), capacities, and requirements are given below:
A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its manufacturing facilities to three regional warehouses. It is thinking about using a transportation LP formulation to exactly matched capacities and requirements. Data on transportation costs (in dollars per unit), capacities, and requirements are given below:   a. How many variables are involved in the LP formulation? b. How many constraints are there in this problem? c. What is the constraint corresponding to plant 2?<div style=padding-top: 35px>
a. How many variables are involved in the LP formulation?
b. How many constraints are there in this problem?
c. What is the constraint corresponding to plant 2?
Question
Differentiate between a feasible solution and an optimal solution.
Question
Explain the essence of a transportation problem.
Question
A company manufactures 50-inch and 75-inch rear projection television sets. Each 50-inch set contributes $200 to profits and each 75-inch set contributes $475 to profits. The company has purchase commitments for 500 50-inch sets and 200 75-inch sets for the next month, so they want to make at least that many television sets. Although they think they can sell all the 50-inch sets that they could currently make, they do not think they can sell more than 375 75-inch sets. Their production capacity allows them to make only 975 sets in total including both types of television sets. They want to know how many of each type to make so as to maximize profits.
a. What is the objective function for this LP problem?
b. What are the constraints involving x1, assuming that x1 corresponds to 50-inch TV sets?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Question
What characterizes a linear function?
Question
A clothing distributor has four warehouses that serve four large cities. Each warehouse has a monthly capacity of 5,000 blue jeans. They are considering using a transportation LP approach to match demand and capacity. The following table provides data on their shipping cost, capacity, and demand constraints on a per-month basis:
 Warehouse  City E  City F  City G  City H  A 0.530.210.520.41 B 0.310.380.410.29 C 0.560.320.540.33 D 0.420.550.340.52 City demand 2.0003,0003,5005,500\begin{array}{ccccc}\text { Warehouse } &\text { City E }&\text { City F }&\text { City G }&\text { City H }\\\text { A } & 0.53 & 0.21 & 0.52 & 0.41 \\\text { B } & 0.31 & 0.38 & 0.41 & 0.29 \\\text { C } & 0.56 & 0.32 & 0.54 & 0.33 \\\text { D } & 0.42 & 0.55 & 0.34 & 0.52 \\\text { City demand } & 2.000 & 3,000 & 3,500 & 5,500\end{array}
a. How many variables are there in this formulation?
b. How many constraints are involved in this problem?
c. What is the constraint corresponding to City F?
Question
The Alpha Beta Corporation makes laser and inkjet printers for personal computers. Each laser printer yields $40.00 in profits and each ink jet printer provides $20.00. Each of the printers goes through two assembly areas. The following table provides processing times per unit (in minutes) as well as total available processing times per department:
 Printer  Dept. A  Dept. B  Laser 912 Inkjet 68 Total time per day 216384\begin{array}{lcc}\text { Printer }&\text { Dept. A }&\text { Dept. B }\\\text { Laser } & 9 & 12 \\\text { Inkjet } & 6 & 8 \\\text { Total time per day } & 216 & 384\end{array}
Sales commitments require at least 5 laser printers and 10 inkjet printers to be made per day. The company is interested in determining how many of each printer to produce so as to maximize its profit.
a. What is the objective function for this LP problem?
b. What are the constraints corresponding to Dept. A if x1 corresponds to laser printers?
c. What are the optimal solution points for this problem?
d. What is the optimal value of the objective function?
Question
Explain the essence of a blending problem.
Question
ABC Products Inc. produces three products (A, B, and C) on three machines. Machines 1 and 2 are available for 40 hours a week, and Machine 3 is available for 60 hours a week. Profit contribution and standard production time in hours are given in the following table:
ABC Products Inc. produces three products (A, B, and C) on three machines. Machines 1 and 2 are available for 40 hours a week, and Machine 3 is available for 60 hours a week. Profit contribution and standard production time in hours are given in the following table:   Only one operator per machine is required on Machines #1 and #2. Two operators are required for Machine #3. Therefore, two hours of labor must be scheduled for each hour of Machine #3's time. To restate this requirement, two operators must be scheduled for each hour of Machine #3's operation, as well as one operator for each hour of Machine #1's operation and one operator for each hour of Machine #2's operation. A total of 110 labor hours is available for assignment to the three machines during the coming week. Other production requirements are that Product A cannot account for more than 40% of the units produced and that Product C must account for at least 25% of the units produced. a. Develop the constraint for the capacity limit of Machine #1. b. Develop the constraint for the capacity limit of Machine #3. c. Develop the constraint for the labor capacity limit. d. Develop the constraint for limiting Product A to no more than 40% of the units produced. e. Develop the constraint that ensures Product C accounts for at least 25% of the units produced.<div style=padding-top: 35px> Only one operator per machine is required on Machines #1 and #2. Two operators are required for Machine #3. Therefore, two hours of labor must be scheduled for each hour of Machine #3's time. To restate this requirement, two operators must be scheduled for each hour of Machine #3's operation, as well as one operator for each hour of Machine #1's operation and one operator for each hour of Machine #2's operation. A total of 110 labor hours is available for assignment to the three machines during the coming week. Other production requirements are that Product A cannot account for more than 40% of the units produced and that Product C must account for at least 25% of the units produced.
a. Develop the constraint for the capacity limit of Machine #1.
b. Develop the constraint for the capacity limit of Machine #3.
c. Develop the constraint for the labor capacity limit.
d. Develop the constraint for limiting Product A to no more than 40% of the units produced.
e. Develop the constraint that ensures Product C accounts for at least 25% of the units produced.
Question
A cargo airline company in South America ferries materials from four different airfields in Brazil (called A, B, C, and D) to two different airfields in Peru (numbered 1 and 2). Distances in hundreds of miles between the six different airfields are as shown below:
 Brazil  Peru  A  B  C  D 1261752128129 Capacities 60407555\begin{array}{ccccr}&&\text { Brazil }\\\text { Peru } & \text { A } & \text { B } & \text { C } & \text { D }\\1 & 2 & 6 & 17 & 5 \\2 & 12 & 8 & 12 & 9 \\\text { Capacities } & 60 & 40 & 75 & 55\end{array}
Requirements for airfield 1 are 140 tons per year and 80 tons per year for airfield 2. The president of the airlines wants to determine how much material should be shipped from each airfield in Brazil to each airfield in Peru so as to minimize total travel distance.
a. How many decision variables are there in this problem?
b. What is the constraint corresponding to airfield 1?
c. What is the constraint corresponding to airfield B?
Question
Which of the following is generally TRUE of the transportation problem of linear programming?

A) A specified quantity of goods is needed at each demand location.
B) The objective is to maximize profit.
C) The shipping cost from each source to each destination is the same.
D) An exponential loading/unloading distribution is assumed.
Question
Explain the steps necessary to solve a linear programming problem using Microsoft Excel's Solver.
Question
The Northwest Flower Company owns a greenhouse, which supplies roses and carnations to florists in Oregon, Washington, and Idaho. The greenhouse can grow any combination of the two flowers. They sell the flowers in "bunches" with 25 blooms to a bunch. They have 10,000 square feet available for planting this year. Each bunch of roses takes about 4 square feet and each bunch of carnations about 5 square feet. A special fertilizer is required for the flowers: roses need 5 pounds and carnations 2 pounds. The availability of the fertilizer is limited to 5000 pounds. Sales commitments require the company to grow at least 500 bunches of roses. Profit contributions are $6 per bunch of roses and $8 per bunch of carnations.
a. What is the objective function if the company wants to maximize its profits?
b. What is the constraint for the square footage assuming x1 corresponds to roses?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Question
Discuss the concept of optimization models with examples.
Question
The Pacific Computer Company makes two models of notebook personal computers: Model 410 with CD-ROM drive, and Model 540 with DVD drive. Profits on each model are $100 and $150, respectively. Weekly manufacturing data (in minutes) are given below:
 Notebook  Dept. A  Dept. B  Model  Manuf. Time  Manuf. Time  Assembly Time 4105142554010740\begin{array}{cccc}\text { Notebook } & \text { Dept. A } & \text { Dept. B } \\\text { Model } & \text { Manuf. Time } & \text { Manuf. Time }&\text { Assembly Time }\\410 & 5 & 14 & 25 \\540 & 10 & 7 & 40\end{array}
Manufacturing time available in department A for the coming week is 300 minutes, and for department B, it is 420 minutes. Total time available during the week to assemble the fabricated units is 1600 minutes.
a. What is the objective function if the company wants to maximize profits?
b. What is the constraint corresponding to Department A assuming x1 corresponds to Model 410?
c. What is the optimum solution point for this problem?
d. What is the maximum possible total profit?
Question
A small lumber company produces two types of pine boards used in home construction: 2x4s and 2x6s (dimensions in inches). It is attempting to determine how many of each to produce so as to minimize its costs on a per-minute basis. It has sales commitments to produce four 2x4s and two 2x6s per minute, but the management thinks they should not produce any more than eight 2x6s because of market demand. The company is also trying to support the community by employing people. Thus, it wants to keep at least 12 men employed, but only needs 2 men to produce each 2x4 and 1 person to produce each 2x6 per minute. It costs the company $.50 to produce a 2x4 and $.80 to produce a 2x6 per minute.
a. What is the objective function for this LP problem?
b. What is the constraint for the employment issue, assuming x1 corresponds to 2x4s?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Question
Given the partial project network below and the fact that F can be crashed three times if xt = start
time of Activity i, and yi = amount of crash time used for Activity i.  Given the partial project network below and the fact that F can be crashed three times if x<sub>t</sub> = start time of Activity i, and y<sub>i</sub> = amount of crash time used for Activity i.   a. Which of the following is correct? x<sub>F</sub>  \ge  x<sub>D</sub> + 10 - y<sub>D</sub> or x<sub>F</sub>  \ge  x<sub>E</sub> + 10 + y<sub>E</sub> or y<sub>D</sub>, y<sub>E</sub>  \le  0 or x<sub>F</sub> -x<sub>D</sub> - x<sub>E</sub> + 10  \ge  3 b. Which of the following is correct? y<sub>D</sub>  \le  3 or y<sub>E</sub>  \le  3 or y<sub>F</sub> = y<sub>D</sub> + y<sub>E</sub> or y<sub>F </sub> \le  3<div style=padding-top: 35px>
a. Which of the following is correct? xF \ge xD + 10 - yD or xF \ge xE + 10 + yE or yD, yE \le 0 or xF -xD - xE + 10 \ge 3
b. Which of the following is correct? yD \le 3 or yE \le 3 or yF = yD + yE or yF \le 3
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/41
auto play flashcards
Play
simple tutorial
Full screen (f)
exit full mode
Deck 17: Appendix: Modeling Using Linear Programming
1
A company has normal capacity for 2,500 units a month. If, x11 and x21 represent the production decisions variables, which of the following equations represents the occurrence of change?

A) x11 + x21 − 2500
B) x11 − x21 − 2500
C) x12 − x21 − 2500
D) x12 + x21 − 2500
A
2
Excel Solver can handle basic linear programming but not the special transportation problem.
True
3
If a company has a demand of 1,600 units for the month of May and a beginning of 900 units, and if Xm = production in May and Lm = the number of lost sales in May, which of the following equations represents the material-balance constraint?

A) Xm - Im + 900 + Lm = 1,600
B) Xm + Im - 900 + Lm = 1,600
C) Xm - Im + 900 - Lm = 1,600
D) -Xm - Im + 900 - Lm = 1,600
A
4
Which of the following factors would generally NOT be part of a linear programming model for blending?

A) Revenue
B) Cost
C) Product/component specifications
D) Supply = demand
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
5
The total project cost can be minimized by minimizing crash costs.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
6
The constraint x1 and x2 \ge 0 refers to:

A) feasibility.
B) maximization.
C) binding.
D) nonnegativity.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
7
Any particular combination of decision variables is referred to as a(n) _____.

A) objective
B) solution
C) constraint
D) coefficient
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
8
A company is considering a rate change, either an increase or a decrease in production, where Xt = production in a time period; Rt = increase in production rate from Period t−1 to Period t; Dt = decrease in production rate from Period t−1 to Period t. Which of the following is correct?

A) Xt − Xt - 1 = Dt − Rt
B) Xt - 1 − Xt = Dt − Rt
C) Xt - 1 − Xt = Rt − Dt
D) Xt − Xt - 1 = Rt − Dt
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
9
Since price is usually set by market conditions, the blending problem's use of linear programming attempts to meet the demand at a minimum cost.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
10
For linear programming to work for project crashing decisions, a dummy activity is needed at the beginning of the project, with a duration of zero (0) time.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
11
Deciding on how much of each grade of gasoline to produce is an example of the linear programming model for blending applications.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
12
The term 'programming' is used in linear programming because these models find the best 'program' or course of action to follow.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
13
The constraint that requires the ending inventory from previous month plus current production minus ending inventory of this month equals this month's demand is known as a demand requirement.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
14
If Rm = increase in the total production level during month 'm' compared to month m-1 and Dm = decrease in the total production level during month 'm' compared to month m-1, which of the following statements can be correct?

A) Rm = Dm = 0.
B) Both Rm and Dm are positive.
C) Both Rm and Dm are negative.
D) One variable can be positive and the other negative.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
15
If a single variable is used to represent the change in production level, only positive changes would be permitted, because of the nonnegativity requirement.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
16
Which of the following factors would generally NOT be part of a linear programming model for production scheduling?

A) Fluctuations in production
B) Inventory levels
C) Waiting time probability distributions
D) Storage capacity
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
17
Constant terms in the objective function are called objective function _____.

A) variables
B) decisions
C) coefficients
D) constraints
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
18
Solutions to a linear programming model that satisfy all constraints are referred to as optimal.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
19
In production scheduling, (ending inventory from the previous month) + (current production)-(ending inventory this month) = _____.

A) production rate change
B) this month's demand
C) amount of overtime/undertime
D) next month's inventory
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
20
The transportation problem is a special type of linear programming that arises in planning the distribution of goods and services from only one supply point to several demand locations.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
21
If Activity C directly precedes both D and E on a project network, and C can be crashed three (3) times using linear programming, then:

A) crash time affects only C.
B) crash time affects only C and D.
C) crash time affects only C and E.
D) crash time affects both D and E.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
22
A cement company has three factories that they identify as Alpha, Beta, and Gamma. They supply cement to three warehouses referred to as X, Y, and Z. The company wants to determine how much cement should be shipped from each factory to each warehouse to minimize shipping costs. The cost to ship each 100-pound bag, along with warehouse requirements and factory capacities in bags are shown in the table below:
A cement company has three factories that they identify as Alpha, Beta, and Gamma. They supply cement to three warehouses referred to as X, Y, and Z. The company wants to determine how much cement should be shipped from each factory to each warehouse to minimize shipping costs. The cost to ship each 100-pound bag, along with warehouse requirements and factory capacities in bags are shown in the table below:   a. How many decision variables are there in this problem? b. What is (are) the constraint(s) corresponding to factory Alpha? c. How many constraints are required for this problem?
a. How many decision variables are there in this problem?
b. What is (are) the constraint(s) corresponding to factory Alpha?
c. How many constraints are required for this problem?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
23
The precedence relationships in a network limit the activity _____.

A) nonnegativity time
B) overtime
C) crash time
D) inventory time
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
24
A food processing company makes meatloaf to be sold in the frozen food section of supermarkets.Each week, the recipe used changes based on the current cost of ingredients. Ingredients and current costs are as shown below:
 Ingredient  Cost/pound  pork $2.87 hamburger $1.63 wheat filler $0.22 corn filler $0.16\begin{array}{ll}\text { Ingredient }&\text { Cost/pound }\\\text { pork } & \$ 2.87 \\\text { hamburger } & \$ 1.63 \\\text { wheat filler } & \$ 0.22 \\\text { corn filler } & \$ 0.16\end{array}
For each batch made, at least 300 pounds of pork and 100 pounds of hamburger are required. No more than 200 pounds of wheat filler can be used per batch, and the amount of corn filler has to range between 50 and 150 pounds. Moreover, each batch must contain at least 500 pounds of meat and no more than 200 pounds of filler.
a. What is the objective function if the company seeks to minimize costs?
b. If x1 is the amount of pork used, what are the constraints associated with it?
c. If x3 is the amount of wheat filler used, what are the constraints associated with it?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
25
A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its manufacturing facilities to three regional warehouses. It is thinking about using a transportation LP formulation to exactly matched capacities and requirements. Data on transportation costs (in dollars per unit), capacities, and requirements are given below:
A computer manufacturing company wants to develop a monthly plan for shipping finished products from three of its manufacturing facilities to three regional warehouses. It is thinking about using a transportation LP formulation to exactly matched capacities and requirements. Data on transportation costs (in dollars per unit), capacities, and requirements are given below:   a. How many variables are involved in the LP formulation? b. How many constraints are there in this problem? c. What is the constraint corresponding to plant 2?
a. How many variables are involved in the LP formulation?
b. How many constraints are there in this problem?
c. What is the constraint corresponding to plant 2?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
26
Differentiate between a feasible solution and an optimal solution.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
27
Explain the essence of a transportation problem.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
28
A company manufactures 50-inch and 75-inch rear projection television sets. Each 50-inch set contributes $200 to profits and each 75-inch set contributes $475 to profits. The company has purchase commitments for 500 50-inch sets and 200 75-inch sets for the next month, so they want to make at least that many television sets. Although they think they can sell all the 50-inch sets that they could currently make, they do not think they can sell more than 375 75-inch sets. Their production capacity allows them to make only 975 sets in total including both types of television sets. They want to know how many of each type to make so as to maximize profits.
a. What is the objective function for this LP problem?
b. What are the constraints involving x1, assuming that x1 corresponds to 50-inch TV sets?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
29
What characterizes a linear function?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
30
A clothing distributor has four warehouses that serve four large cities. Each warehouse has a monthly capacity of 5,000 blue jeans. They are considering using a transportation LP approach to match demand and capacity. The following table provides data on their shipping cost, capacity, and demand constraints on a per-month basis:
 Warehouse  City E  City F  City G  City H  A 0.530.210.520.41 B 0.310.380.410.29 C 0.560.320.540.33 D 0.420.550.340.52 City demand 2.0003,0003,5005,500\begin{array}{ccccc}\text { Warehouse } &\text { City E }&\text { City F }&\text { City G }&\text { City H }\\\text { A } & 0.53 & 0.21 & 0.52 & 0.41 \\\text { B } & 0.31 & 0.38 & 0.41 & 0.29 \\\text { C } & 0.56 & 0.32 & 0.54 & 0.33 \\\text { D } & 0.42 & 0.55 & 0.34 & 0.52 \\\text { City demand } & 2.000 & 3,000 & 3,500 & 5,500\end{array}
a. How many variables are there in this formulation?
b. How many constraints are involved in this problem?
c. What is the constraint corresponding to City F?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
31
The Alpha Beta Corporation makes laser and inkjet printers for personal computers. Each laser printer yields $40.00 in profits and each ink jet printer provides $20.00. Each of the printers goes through two assembly areas. The following table provides processing times per unit (in minutes) as well as total available processing times per department:
 Printer  Dept. A  Dept. B  Laser 912 Inkjet 68 Total time per day 216384\begin{array}{lcc}\text { Printer }&\text { Dept. A }&\text { Dept. B }\\\text { Laser } & 9 & 12 \\\text { Inkjet } & 6 & 8 \\\text { Total time per day } & 216 & 384\end{array}
Sales commitments require at least 5 laser printers and 10 inkjet printers to be made per day. The company is interested in determining how many of each printer to produce so as to maximize its profit.
a. What is the objective function for this LP problem?
b. What are the constraints corresponding to Dept. A if x1 corresponds to laser printers?
c. What are the optimal solution points for this problem?
d. What is the optimal value of the objective function?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
32
Explain the essence of a blending problem.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
33
ABC Products Inc. produces three products (A, B, and C) on three machines. Machines 1 and 2 are available for 40 hours a week, and Machine 3 is available for 60 hours a week. Profit contribution and standard production time in hours are given in the following table:
ABC Products Inc. produces three products (A, B, and C) on three machines. Machines 1 and 2 are available for 40 hours a week, and Machine 3 is available for 60 hours a week. Profit contribution and standard production time in hours are given in the following table:   Only one operator per machine is required on Machines #1 and #2. Two operators are required for Machine #3. Therefore, two hours of labor must be scheduled for each hour of Machine #3's time. To restate this requirement, two operators must be scheduled for each hour of Machine #3's operation, as well as one operator for each hour of Machine #1's operation and one operator for each hour of Machine #2's operation. A total of 110 labor hours is available for assignment to the three machines during the coming week. Other production requirements are that Product A cannot account for more than 40% of the units produced and that Product C must account for at least 25% of the units produced. a. Develop the constraint for the capacity limit of Machine #1. b. Develop the constraint for the capacity limit of Machine #3. c. Develop the constraint for the labor capacity limit. d. Develop the constraint for limiting Product A to no more than 40% of the units produced. e. Develop the constraint that ensures Product C accounts for at least 25% of the units produced. Only one operator per machine is required on Machines #1 and #2. Two operators are required for Machine #3. Therefore, two hours of labor must be scheduled for each hour of Machine #3's time. To restate this requirement, two operators must be scheduled for each hour of Machine #3's operation, as well as one operator for each hour of Machine #1's operation and one operator for each hour of Machine #2's operation. A total of 110 labor hours is available for assignment to the three machines during the coming week. Other production requirements are that Product A cannot account for more than 40% of the units produced and that Product C must account for at least 25% of the units produced.
a. Develop the constraint for the capacity limit of Machine #1.
b. Develop the constraint for the capacity limit of Machine #3.
c. Develop the constraint for the labor capacity limit.
d. Develop the constraint for limiting Product A to no more than 40% of the units produced.
e. Develop the constraint that ensures Product C accounts for at least 25% of the units produced.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
34
A cargo airline company in South America ferries materials from four different airfields in Brazil (called A, B, C, and D) to two different airfields in Peru (numbered 1 and 2). Distances in hundreds of miles between the six different airfields are as shown below:
 Brazil  Peru  A  B  C  D 1261752128129 Capacities 60407555\begin{array}{ccccr}&&\text { Brazil }\\\text { Peru } & \text { A } & \text { B } & \text { C } & \text { D }\\1 & 2 & 6 & 17 & 5 \\2 & 12 & 8 & 12 & 9 \\\text { Capacities } & 60 & 40 & 75 & 55\end{array}
Requirements for airfield 1 are 140 tons per year and 80 tons per year for airfield 2. The president of the airlines wants to determine how much material should be shipped from each airfield in Brazil to each airfield in Peru so as to minimize total travel distance.
a. How many decision variables are there in this problem?
b. What is the constraint corresponding to airfield 1?
c. What is the constraint corresponding to airfield B?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
35
Which of the following is generally TRUE of the transportation problem of linear programming?

A) A specified quantity of goods is needed at each demand location.
B) The objective is to maximize profit.
C) The shipping cost from each source to each destination is the same.
D) An exponential loading/unloading distribution is assumed.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
36
Explain the steps necessary to solve a linear programming problem using Microsoft Excel's Solver.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
37
The Northwest Flower Company owns a greenhouse, which supplies roses and carnations to florists in Oregon, Washington, and Idaho. The greenhouse can grow any combination of the two flowers. They sell the flowers in "bunches" with 25 blooms to a bunch. They have 10,000 square feet available for planting this year. Each bunch of roses takes about 4 square feet and each bunch of carnations about 5 square feet. A special fertilizer is required for the flowers: roses need 5 pounds and carnations 2 pounds. The availability of the fertilizer is limited to 5000 pounds. Sales commitments require the company to grow at least 500 bunches of roses. Profit contributions are $6 per bunch of roses and $8 per bunch of carnations.
a. What is the objective function if the company wants to maximize its profits?
b. What is the constraint for the square footage assuming x1 corresponds to roses?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
38
Discuss the concept of optimization models with examples.
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
39
The Pacific Computer Company makes two models of notebook personal computers: Model 410 with CD-ROM drive, and Model 540 with DVD drive. Profits on each model are $100 and $150, respectively. Weekly manufacturing data (in minutes) are given below:
 Notebook  Dept. A  Dept. B  Model  Manuf. Time  Manuf. Time  Assembly Time 4105142554010740\begin{array}{cccc}\text { Notebook } & \text { Dept. A } & \text { Dept. B } \\\text { Model } & \text { Manuf. Time } & \text { Manuf. Time }&\text { Assembly Time }\\410 & 5 & 14 & 25 \\540 & 10 & 7 & 40\end{array}
Manufacturing time available in department A for the coming week is 300 minutes, and for department B, it is 420 minutes. Total time available during the week to assemble the fabricated units is 1600 minutes.
a. What is the objective function if the company wants to maximize profits?
b. What is the constraint corresponding to Department A assuming x1 corresponds to Model 410?
c. What is the optimum solution point for this problem?
d. What is the maximum possible total profit?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
40
A small lumber company produces two types of pine boards used in home construction: 2x4s and 2x6s (dimensions in inches). It is attempting to determine how many of each to produce so as to minimize its costs on a per-minute basis. It has sales commitments to produce four 2x4s and two 2x6s per minute, but the management thinks they should not produce any more than eight 2x6s because of market demand. The company is also trying to support the community by employing people. Thus, it wants to keep at least 12 men employed, but only needs 2 men to produce each 2x4 and 1 person to produce each 2x6 per minute. It costs the company $.50 to produce a 2x4 and $.80 to produce a 2x6 per minute.
a. What is the objective function for this LP problem?
b. What is the constraint for the employment issue, assuming x1 corresponds to 2x4s?
c. What is the optimal solution point for this problem?
d. What is the optimal value of the objective function?
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
41
Given the partial project network below and the fact that F can be crashed three times if xt = start
time of Activity i, and yi = amount of crash time used for Activity i.  Given the partial project network below and the fact that F can be crashed three times if x<sub>t</sub> = start time of Activity i, and y<sub>i</sub> = amount of crash time used for Activity i.   a. Which of the following is correct? x<sub>F</sub>  \ge  x<sub>D</sub> + 10 - y<sub>D</sub> or x<sub>F</sub>  \ge  x<sub>E</sub> + 10 + y<sub>E</sub> or y<sub>D</sub>, y<sub>E</sub>  \le  0 or x<sub>F</sub> -x<sub>D</sub> - x<sub>E</sub> + 10  \ge  3 b. Which of the following is correct? y<sub>D</sub>  \le  3 or y<sub>E</sub>  \le  3 or y<sub>F</sub> = y<sub>D</sub> + y<sub>E</sub> or y<sub>F </sub> \le  3
a. Which of the following is correct? xF \ge xD + 10 - yD or xF \ge xE + 10 + yE or yD, yE \le 0 or xF -xD - xE + 10 \ge 3
b. Which of the following is correct? yD \le 3 or yE \le 3 or yF = yD + yE or yF \le 3
Unlock Deck
Unlock for access to all 41 flashcards in this deck.
Unlock Deck
k this deck
locked card icon
Unlock Deck
Unlock for access to all 41 flashcards in this deck.