Question 1

Goal programming violates the divisibility property of linear programming.

Accepted Answer

A) True 
 B)False  False

Question 2

A(n) ________ assigns numerical values to different levels of preferences.

Accepted Answer

preference scale

Question 3

A(n) ________ model is a similar to AHP, but simpler and easier to understand.

Accepted Answer

scoring

Question 4

Ashley's manufactures home furnishings for department stores. Planning is underway for the production of the following items during the next production period:
 $$\begin{array} { l c c c } 
& \text { Quilts } \left( x _ { \mathbf { 1 } } \right) & \text { Blinds } \left( \boldsymbol { x } _ { \mathbf { 2 } } \right) & \text { Pillows } \left( x _ { 3 } \right) \
\text { Fabric required (yards) } \left( \boldsymbol { d } _ { \mathbf { 1 } } \right) & 7 & 4 & 9 \
\text { Time required (hours) } \left( \boldsymbol { d } _ { \mathbf { 2 } } \right) & 1.5 & 2 & 0.5 \
\text { Packaging material (ounces) } \left( \boldsymbol { d } _ { \mathbf { 3 } } \right) & 3 & 2 & 1 \
\text { Profit } \left( \boldsymbol { d } _ { \mathbf { 4 } } \right) & 12 & 10 & 8
\end{array}$$ Ashley has 3000 yards of material in stock for this production period. Five hundred hours of production time are scheduled and 400 ounces of packaging material is available. Each of these quantities can be adjusted through overtime or extra purchases. Ashley's highest priority is to achieve a profit of $3200. Her second priority is to avoid additional purchases of packaging material. Third, she wants to use all of the scheduled production hours, and fourth, minimize any fabric remaining from the 3000 yards. Note that the deviational variables associated with each item are given in the table.
-What is the profit constraint?

Accepted Answer

12x₁ + 10x₂

Question 5

A positive deviational variable is the amount by which a goal level is

Accepted Answer

A)  underachieved. 
B)  exceeded. 
C)  minimized. 
D)  maximized. 
A)  underachieved. 
B)  exceeded. 
C)  minimized. 
D)  maximized.

Question 6

A negative deviational variable is the amount by which a goal level is exceeded.

Accepted Answer

A) True 
 B)False

Question 7

A ________ vector is the average of the values in each row of the normalized matrix in the AHP process.

Accepted Answer

The answer of A ________ vector is the average of...

Question 8

An investor has $80,000 to invest in three stocks, stock A costs $100, stock B costs $120 and stock C costs $80. Each stock A has a risk factor of 8, each stock B has a risk factor of 10 and each stock C has a risk factor of 7. The investor believes that the sum of the risk factors for all stocks purchase should not exceed 6000. The projected annual growth rate for the three stocks are 9%, 13% and 8% respectively. The projected annual dividend income from these stocks are as follows: Stock A: $14/stock, Stock B: $15/stock, and Stock C: $20/stock. The investor desires an annual dividend income of $10,000. The investor has established the following goals in order of their importance:

(1) 	The investor believes that the budget cannot be exceeded. (d1)
(2) 	The risk factor should not exceed the target amount of 6000. (d2) 
(3) 	The average annual growth rate in stock prices must be at least 10%. (d3) 
(4) 	The investor desires a dividend income of at least $10,000. (d4)

-State the goal programming objective function.

Accepted Answer

Min P₁ d₁

Question 9

Consider the following constraint: 2x1 + 3x2 =60. Assume that we convert this constraint into a goal constraint with the value of x1 = 15 and the value of x2 = 15. Then the values of d1+ and d1- are ________ and ________, respectively.

Accepted Answer

A)  0, 15 
B)  15, 0 
C)  20, 0 
D)  0, 20 
A)  0, 15 
B)  15, 0 
C)  20, 0 
D)  0, 20

Question 10

The analytical hierarchy process is a method for ________ decision alternatives.

Accepted Answer

A)  creating 
B)  ranking 
C)  changing 
D)  deleting 
A)  creating 
B)  ranking 
C)  changing 
D)  deleting

Question 11

A decision with more than one objective

Accepted Answer

A)  should be decomposed into a separate model for each objective . 
B)  depends on the probability of satisfying each objective. 
C)  requires the decision maker to put the objectives in some order of importance. 
D)  cannot have an optimal solution. 
A)  should be decomposed into a separate model for each objective . 
B)  depends on the probability of satisfying each objective. 
C)  requires the decision maker to put the objectives in some order of importance. 
D)  cannot have an optimal solution.

Question 12

Riverside Industries makes two products and each product is processed in three departments. The time requirements for each product in each department are given below. The profit for each product is also provided as well as the available hours in each department.
 $$\begin{array} { c c c c c } 
\text { Product } & \text { Department A } & \text { Department B } & \text { Department C } & \text { Profit } \
\mathbf { 1 } & 3 & 4 & 2 & 1 \
\mathbf { 2 } & 2 & 1 & 2 & 2\
Available~ Hours&600&400&400
\end{array}$$ Management wants to achieve three goals. The first two goals are equal in priority.
Priority 1: Produce at least 125 units of product 1.
Priority 1: Produce at least 80 units of product 2.
Priority 2: Achieve a profit of at least 300.
-The goal programming model for this problem has how many constraints?

Accepted Answer

A)  3 
B)  4 
C)  6 
D)  7 
A)  3 
B)  4 
C)  6 
D)  7

Question 13

The objective function min P1d1- , P2d2+

Accepted Answer

A)  attempts to avoid being below target for the priority 1 goal. 
B)  attempts to avoid being below target for the priority 2 goal. 
C)  will not have any feasible solutions. 
D)  will have a solution only if P1 > P2. 
A)  attempts to avoid being below target for the priority 1 goal. 
B)  attempts to avoid being below target for the priority 2 goal. 
C)  will not have any feasible solutions. 
D)  will have a solution only if P1 > P2.

Question 14

A production of 300 units of Twiddle Bugs, an educational toy for children, must be completed within 1 week by BugU Manufacturing. Two production lines are available, each for 30 hours during the week. Production line 1 can produce five units per hour and production line 2 can produce four units an hour. Line 1 costs $50 per hour to operate and line 2 costs $55 per hour. Overtime is available for line 1 at $15 per hour and for line 2 at $12 per hour. Management goals in decreasing order are:
P1: Produce 300 units.
P2: Maximum allowable overtime of 6 hours for line 1.
P3: Cost of overtime must not exceed $750.
P4: Avoid the underutilization of either production line. Assign weights that are proportional to their production capability.
P5: Producing more than 300 units is 1-1/2 times as undesirable as producing under 300 units.
-What is the objective function?

Accepted Answer

Minimize P_1Ad₁

Question 15

A company has three goals, listed in order of importance.
1) Achieve a total profit of at least $240 million.
2) Maintain the current employment level of 3,000 employees
3) Invest no more than $70 million in capital.
What is the objective function for a goal program for this situation?

Accepted Answer

A)  Min P1d1- , P2d2- , P3d3+ 
B)  Min P1d1- , P2d2+ , P2d2- , P3d3- 
C)  Min P1d1- , P2d2- , P2d2- , P3d3+ 
D)  Min P1d1+ , P2d2- , P2d2- , P3d3+ 
A)  Min P1d1- , P2d2- , P3d3+ 
B)  Min P1d1- , P2d2+ , P2d2- , P3d3- 
C)  Min P1d1- , P2d2- , P2d2- , P3d3+ 
D)  Min P1d1+ , P2d2- , P2d2- , P3d3+

Question 16

Assume that a plant manager has to decide where to locate its warehouse. The decision has been narrowed down to choices among the following three cities: Detroit, Cleveland, and St. Louis. The following pairwise comparison matrix summarizes the preferences of the plant manager.
 $$\begin{array} { | c | c | c | c | } 
\hline & \text { Detroit } & \text { Cleveland } & \text { St. Louis } \
\hline \text { Detroit } & 1 & 1 / 3 & 1 / 4 \
\hline \text { Cleveland } & 3 & 1 & 1 / 2 \
\hline \text { St. Louis } & 4 & 2 & 1 \
\hline
\end{array}$$ 
Determine the normalized matrix.

Accepted Answer

The answer of Assume that a plant manager has to...

Question 17

Ashley's manufactures home furnishings for department stores. Planning is underway for the production of the following items during the next production period:
 $$\begin{array} { l c c c } 
& \text { Quilts } \left( x _ { \mathbf { 1 } } \right) & \text { Blinds } \left( \boldsymbol { x } _ { \mathbf { 2 } } \right) & \text { Pillows } \left( x _ { 3 } \right) \
\text { Fabric required (yards) } \left( \boldsymbol { d } _ { \mathbf { 1 } } \right) & 7 & 4 & 9 \
\text { Time required (hours) } \left( \boldsymbol { d } _ { \mathbf { 2 } } \right) & 1.5 & 2 & 0.5 \
\text { Packaging material (ounces) } \left( \boldsymbol { d } _ { \mathbf { 3 } } \right) & 3 & 2 & 1 \
\text { Profit } \left( \boldsymbol { d } _ { \mathbf { 4 } } \right) & 12 & 10 & 8
\end{array}$$ Ashley has 3000 yards of material in stock for this production period. Five hundred hours of production time are scheduled and 400 ounces of packaging material is available. Each of these quantities can be adjusted through overtime or extra purchases. Ashley's highest priority is to achieve a profit of $3200. Her second priority is to avoid additional purchases of packaging material. Third, she wants to use all of the scheduled production hours, and fourth, minimize any fabric remaining from the 3000 yards. Note that the deviational variables associated with each item are given in the table.
-What is the packaging material constraint?

Accepted Answer

3x₁ + 2x₂

Question 18

Assume that a decision maker has to make a choice between three types of cars. Chevy, Honda, and Ford. Based on three criteria: comfort, MPG, and style.
The row averages for criteria is summarized in the following column vector: $\left[ \begin{array} { l } 
.3 \
.5 \
.2
\end{array} \right]$ 
The preference matrix for the three types of cars is given as follows: $\left[ \begin{array} { l l l } 
.5 & .2 & .2 \
.3 & .7 & .2 \
.2 & .1 & .6
\end{array} \right]$ 
Compute the overall score for each decision alternative (car).

Accepted Answer

Chevy = .2

Question 19

Riverside Industries makes two products and each product is processed in three departments. The time requirements for each product in each department are given below. The profit for each product is also provided as well as the available hours in each department.
 $$\begin{array} { c c c c c } 
\text { Product } & \text { Department A } & \text { Department B } & \text { Department C } & \text { Profit } \
\mathbf { 1 } & 3 & 4 & 2 & 1 \
\mathbf { 2 } & 2 & 1 & 2 & 2\
Available~ Hours&600&400&400
\end{array}$$ Management wants to achieve three goals. The first two goals are equal in priority.
Priority 1: Produce at least 125 units of product 1.
Priority 1: Produce at least 80 units of product 2.
Priority 2: Achieve a profit of at least 300.
-In synthesization, decision alternatives are prioritized ________ criteria/ion.

Accepted Answer

A)  within some 
B)  among some 
C)  among all 
D)  within each 
A)  within some 
B)  among some 
C)  among all 
D)  within each

Question 20

Goal programming solutions ________ achieve all goals.

Accepted Answer

A)  always 
B)  don't always 
C)  sometimes 
D)  never 
A)  always 
B)  don't always 
C)  sometimes 
D)  never

Goal programming violates the divisibility property of linear programming.

A(n) ________ assigns numerical values to different levels of preferences.

A(n) ________ model is a similar to AHP, but simpler and easier to understand.

A positive deviational variable is the amount by which a goal level is

A negative deviational variable is the amount by which a goal level is exceeded.

A ________ vector is the average of the values in each row of the normalized matrix in the AHP process.

Consider the following constraint: 2x1 + 3x2 =60. Assume that we convert this constraint into a goal constraint with the value of x1 = 15 and the value of x2 = 15. Then the values of d1+ and d1- are and , respectively.

The analytical hierarchy process is a method for ________ decision alternatives.

A decision with more than one objective

The objective function min P₁d₁^- , P₂d₂⁺

A company has three goals, listed in order of importance. 1) Achieve a total profit of at least $240 million. 2) Maintain the current employment level of 3,000 employees 3) Invest no more than $70 million in capital. What is the objective function for a goal program for this situation?

Goal programming solutions ________ achieve all goals.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters

Exam 9: Multicriteria Decision Making

Goal programming violates the divisibility property of linear programming.

A(n) ________ assigns numerical values to different levels of preferences.

A(n) ________ model is a similar to AHP, but simpler and easier to understand.

A positive deviational variable is the amount by which a goal level is

A negative deviational variable is the amount by which a goal level is exceeded.

A ________ vector is the average of the values in each row of the normalized matrix in the AHP process.

Consider the following constraint: 2x1 + 3x2 =60. Assume that we convert this constraint into a goal constraint with the value of x1 = 15 and the value of x2 = 15. Then the values of d1+ and d1- are ________ and ________, respectively.

The analytical hierarchy process is a method for ________ decision alternatives.

A decision with more than one objective

The objective function min P1d1- , P2d2+

A company has three goals, listed in order of importance. 1) Achieve a total profit of at least $240 million. 2) Maintain the current employment level of 3,000 employees 3) Invest no more than $70 million in capital. What is the objective function for a goal program for this situation?

Goal programming solutions ________ achieve all goals.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Network Flow Models

Project Management

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters

Consider the following constraint: 2x1 + 3x2 =60. Assume that we convert this constraint into a goal constraint with the value of x1 = 15 and the value of x2 = 15. Then the values of d1+ and d1- are and , respectively.

The objective function min P₁d₁^- , P₂d₂⁺