Question 1

A goal programming problem assumes that its objective function and constraints are linear.

Accepted Answer

A) True 
 B)False  True

Question 2

A company currently has two factories: F1 and F2,and three retail outlets: R1,R2,and R3.The shipping costs per unit along with the monthly capacity and demand requirements are summarized below:
 $\begin{array}{l}
\text { Shipping Cost Per Unit }\
\begin{array}{lllll}
& \mathrm{R} 1 & \mathrm{R} 2& \mathrm{R} 3&\text { Supply } \
\text { F1 } &\$3&\$2&\$4&100\
\text { F2 } & \$ 1 & \$ 3 &\$5&200 \
\text { Demand } & 100 & 100 & 200 &
\end{array}
\end{array}$ 
The firm has decided to build a new factory to expand its productive capacity.The two sites being considered are Philadelphia and Pittsburgh.The estimated shipping costs for the new factories along with their estimated fixed cost and production capacity are summarized below:
   
Which of the new locations will yield the lowest cost in combination with the existing factories and retail outlets?

Accepted Answer

The answer of A company currently has two factories: F1...

Question 3

Consider the following constraint and its associated binary decision variables:
XA + XB + XC ≥ 2.
This constraint is an example of a mutually exclusive constraint.

Accepted Answer

A) True 
 B)False  False

Question 4

Consider the following linear programming problem:
 $$\begin{array} { l } 
\text { Max: } 500 A + 700 B \
\text { Subject to: } \
2 A + 3 B \leq 35 \text { (assembly hours) } \
3 A + 5 B \leq 40 \text { (machine hours) }
\end{array}$$ 
Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

Accepted Answer

The answer of Consider the following linear programming problem:
 \[\begin{array}...

Question 5

Consider the following objective function with prioritized goals: Min: R₁(d₁⁻)+ R₂(d₁⁻).
This implies that goal 2 is of higher rank than goal 1.

Accepted Answer

A) True 
 B)False

Question 6

A city is reviewing the location of its fire stations.The city is made up of a number of districts,as illustrated below.A fire station can be placed in any district and is able to handle the fires for both its neighborhood and any adjacent neighborhood.The objective is to minimize the number of fire stations used.

Accepted Answer

The answer of A city is reviewing the location of...

Question 7

The deviational variable dᵢ⁻ typically denotes underachievement.

Accepted Answer

A) True 
 B)False

Question 8

Consider the following constraint that needs to be expressed as a goal:
3X₁ + 4X₂ ≤ 11.
The correct format is:

Accepted Answer

A) 3X₁ + 4X₂ - d₁⁻ + d₁⁺ = 11 
B) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ = 11 
C) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≥ 11 
D) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≤ 11 
E) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≠ 11 
A) 3X₁ + 4X₂ - d₁⁻ + d₁⁺ = 11 
B) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ = 11 
C) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≥ 11 
D) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≤ 11 
E) 3X₁ + 4X₂ + d₁⁻ - d₁⁺ ≠ 11

Question 9

Consider the following linear programming problem:
 $$\begin{array} { l } 
\text { Max: } 500 A + 700 B \
\text { Subject to: } \
2 A + 3 B \leq 35 \text { (assembly hours) } \
3 A + 5 B \leq 40 \text { (machine hours) }
\end{array}$$ 
Reformulate and solve this problem as a goal programming problem if the following goals,stated in no particular order,must be met.
Goal 1: Produce at least 15 units of each product.
Goal 2: Avoid overtime in the assembly and machine departments.
Goal 3: Achieve at least $100,000 in profit.

Accepted Answer

The answer of Consider the following linear programming problem:
 \[\begin{array}...

Question 10

Consider the following constraint and its associated binary variables: XA + XB = 1.
This constraint is an example of an if-then constraint.

Accepted Answer

A) True 
 B)False

Question 11

If a company produces Product A,then it must produce at least 200 units of Product A.Which of the following constraints model this condition?

Accepted Answer

A) X₁Y₁ ≤ 200 
B) X₁ ≥ 200 + Y₁ 
C) X₁ ≤ 200Y₁ 
D) X₁ - 200Y₁ ≥ 0 
E) X1 > 200 
A) X₁Y₁ ≤ 200 
B) X₁ ≥ 200 + Y₁ 
C) X₁ ≤ 200Y₁ 
D) X₁ - 200Y₁ ≥ 0 
E) X1 > 200

Question 12

The optimal solution to an IP model must be at a corner point of the feasible region.

Accepted Answer

A) True 
 B)False

Question 13

The IP solution can sometimes produce a better objective function value than its LP relaxed problem.

Accepted Answer

A) True 
 B)False

Question 14

When an objective function contains squared terms,and the problem's constraints are linear,it is referred to as a quadratic programming problem.

Accepted Answer

A) True 
 B)False

Question 15

Which of the following statements about nonlinear programming is False?

Accepted Answer

A) Either the objective function or at least one constraint is nonlinear. 
B) The optimal solution must be a corner point solution. 
C) There can be both local and global optimal solutions. 
D) There is no precise way to know where to start the solution search process. 
A) Either the objective function or at least one constraint is nonlinear. 
B) The optimal solution must be a corner point solution. 
C) There can be both local and global optimal solutions. 
D) There is no precise way to know where to start the solution search process.

Question 16

Which type of cost is independent of the volume of production?

Accepted Answer

A) inventory cost 
B) marginal cost 
C) sunk cost 
D) variable cost 
E) fixed charge 
A) inventory cost 
B) marginal cost 
C) sunk cost 
D) variable cost 
E) fixed charge

Question 17

The "bin" option is used in Solver to specify general integer variables.

Accepted Answer

A) True 
 B)False

Question 18

Mr.Smith,an avid reader,must decide on which books to take with him during a long flight.Mr.Smith will use his carry-on bag,which can hold a maximum of 20 pounds.Mr.Smith has attached a satisfaction index for each book,based on a 5-point scale (1 = low satisfaction,5 =high satisfaction),as shown below.
 $$\begin{array} { l c c } 
\text { Book } & \text { Satisfaction Index } & \text { Weight (lbs.) } \
 \text { Marketing } & 4 & 4 \
\text { History } & 5 & 3 \
\text { Statistics } & 1 & 3 \
\text { Management } & 3 & 5 \
\text { Finance } & 3 & 4 \
\text { Economics } & 2 & 3 \
\text { Excel } & 5 & 4 \
\text { Access } & 4 & 5
\end{array}$$ 
Which books should Mr.Smith take with him on the flight to maximize his satisfaction index?

Accepted Answer

The answer of Mr.Smith,an avid reader,must decide on which books...

Question 19

Use this information to answer the following questions.
A decision maker is provided with 5 different potential projects and must determine which projects to choose.The projects require different amounts of capital and different expected net present values (NPV)over the next three years.
  
-Determine which set of projects should be selected in order to achieve the maximum net present value if the decision maker has $150,000 available for investment each year.

Accepted Answer

The answer of Use this information to answer the following...

Question 20

Problems which can be stated as an assortment of desired objectives are known as:

Accepted Answer

A) quadratic programming 
B) integer programming 
C) goal programming 
D) linear programming 
E) binary programming 
A) quadratic programming 
B) integer programming 
C) goal programming 
D) linear programming 
E) binary programming

A goal programming problem assumes that its objective function and constraints are linear.

Consider the following constraint and its associated binary decision variables: XA + XB + XC ≥ 2. This constraint is an example of a mutually exclusive constraint.

Consider the following objective function with prioritized goals: Min: R₁(d₁⁻)+ R₂(d₁⁻). This implies that goal 2 is of higher rank than goal 1.

The deviational variable dᵢ⁻ typically denotes underachievement.

Consider the following constraint that needs to be expressed as a goal: 3X₁ + 4X₂ ≤ 11. The correct format is:

Consider the following constraint and its associated binary variables: XA + XB = 1. This constraint is an example of an if-then constraint.

If a company produces Product A,then it must produce at least 200 units of Product A.Which of the following constraints model this condition?

The optimal solution to an IP model must be at a corner point of the feasible region.

The IP solution can sometimes produce a better objective function value than its LP relaxed problem.

When an objective function contains squared terms,and the problem's constraints are linear,it is referred to as a quadratic programming problem.

Which of the following statements about nonlinear programming is False?

Which type of cost is independent of the volume of production?

The "bin" option is used in Solver to specify general integer variables.

Problems which can be stated as an assortment of desired objectives are known as:

Introduction to Managerial Decision Making

Linear Programming Models: Graphical and Computer Methods

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Transportation, Assignment, and Network Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters

Exam 6: Integer, Goal, and Nonlinear Programming Models

A goal programming problem assumes that its objective function and constraints are linear.

Consider the following constraint and its associated binary decision variables: XA + XB + XC ≥ 2. This constraint is an example of a mutually exclusive constraint.

Consider the following linear programming problem: Max: 500A+700B Subject to: 2A+3B\leq35 (assembly hours) 3A+5B\leq40 (machine hours) Reformulate and solve this problem as a goal programming problem if the following prioritized goals must be met.

Consider the following objective function with prioritized goals: Min: R₁(d₁⁻)+ R₂(d₁⁻). This implies that goal 2 is of higher rank than goal 1.

The deviational variable dᵢ⁻ typically denotes underachievement.

Consider the following constraint that needs to be expressed as a goal: 3X₁ + 4X₂ ≤ 11. The correct format is:

Consider the following constraint and its associated binary variables: XA + XB = 1. This constraint is an example of an if-then constraint.

If a company produces Product A,then it must produce at least 200 units of Product A.Which of the following constraints model this condition?

The optimal solution to an IP model must be at a corner point of the feasible region.

The IP solution can sometimes produce a better objective function value than its LP relaxed problem.

When an objective function contains squared terms,and the problem's constraints are linear,it is referred to as a quadratic programming problem.

Which of the following statements about nonlinear programming is False?

Which type of cost is independent of the volume of production?

The "bin" option is used in Solver to specify general integer variables.

Problems which can be stated as an assortment of desired objectives are known as:

Introduction to Managerial Decision Making

Linear Programming Models: Graphical and Computer Methods

Linear Programming Modeling Applications with Computer Analyses in Excel

Linear Programming Sensitivity Analysis

Transportation, Assignment, and Network Models

Project Management

Decision Analysis

Queuing Models

Simulation Modeling

Forecasting Models

Inventory Control Models

Filters