Question 1

Goal programming permits multiple objectives to be satisfied.

Accepted Answer

A) True 
 B)False

Question 2

Consider the following 0-1 integer programming problem:   If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?

Accepted Answer

A)  2X + 2Y + 2Z ≤ 3 
B)  X + Y + Z ≤ 2 
C)  X ≤ 2, and Y ≤ 2, and Z ≤ 2 
D)  X, Y, Z ≤ 2 
E)  None of the above 
A)  2X + 2Y + 2Z ≤ 3 
B)  X + Y + Z ≤ 2 
C)  X ≤ 2, and Y ≤ 2, and Z ≤ 2 
D)  X, Y, Z ≤ 2 
E)  None of the above

Question 3

A type of integer programming is

Accepted Answer

A)  pure. 
B)  mixed. 
C)  zero-one. 
D)  All of the above 
E)  None of the above 
A)  pure. 
B)  mixed. 
C)  zero-one. 
D)  All of the above 
E)  None of the above

Question 4

A goal programming problem had two goals (with no priorities assigned). Goal number 1 was to achieve a cost of $3,600 and goal number 2 was to complete the task in 400 hours or fewer. The optimal solution to this problem resulted in a cost of $3,600 and a completion time of 420 hours. What was the value for the objective function for this goal programming problem?

Accepted Answer

A)  400 
B)  -400 
C)  20 
D)  0 
E)  None of the above 
A)  400 
B)  -400 
C)  20 
D)  0 
E)  None of the above

Question 5

0-1 integer programming might be applicable to selecting the best gymnastics team to represent a country from among all identified teams.

Accepted Answer

A) True 
 B)False

Question 6

The following represents a:

Accepted Answer

A)  goal programming problem. 
B)  mixed integer programming problem. 
C)  nonlinear programming problem. 
D)  0-1 integer programming problem. 
E)  pure integer programming problem. 
A)  goal programming problem. 
B)  mixed integer programming problem. 
C)  nonlinear programming problem. 
D)  0-1 integer programming problem. 
E)  pure integer programming problem.

Question 7

Table 10-1
A company has decided to use 0-1 integer programming to help make some investment decisions. There are three possible investment alternatives from which to choose, but if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred (i.e., it is impossible to build one-half of a factory). The integer programming model is as follows:   The optimal solution is XS1U1B11S1U1B0 = 0, XS1U1B12S1U1B0 = 1, XS1U1B13S1U1B0 = 1
-In Table 10-1, which presents an integer programming problem, using the optimal solution means only two of the alternatives would be selected. How much slack is there in the third constraint?

Accepted Answer

A)  0 
B)  3 
C)  33 
D)  36 
E)  None of the above 
A)  0 
B)  3 
C)  33 
D)  36 
E)  None of the above

Question 8

An integer programming (minimization) problem was first solved as a linear programming problem, and the objective function value (cost) was $253.67. The two decision variables (X, Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution, which of the following must be true for the optimal integer solution to this problem?

Accepted Answer

A)  X = 13 Y = 33 
B)  X = 12 Y = 32 
C)  The objective function value must be less than $253.67. 
D)  The objective function value will be greater than $253.67. 
E)  None of the above 
A)  X = 13 Y = 33 
B)  X = 12 Y = 32 
C)  The objective function value must be less than $253.67. 
D)  The objective function value will be greater than $253.67. 
E)  None of the above

Question 9

Unfortunately, multiple goals in goal programming are not able to be prioritized and solved.

Accepted Answer

A) True 
 B)False

Question 10

Table 10-2  
-According to Table 10-2, which presents a solution for an integer programming problem, at the optimal solution, how much slack exists in the third constraint?

Accepted Answer

A)  0 
B)  9 
C)  5 
D)  6 
E)  -1 
A)  0 
B)  9 
C)  5 
D)  6 
E)  -1

Question 11

Assignment problems solved previously by linear programming techniques are also examples of

Accepted Answer

A)  pure-integer programming problems. 
B)  mixed-integer programming problems. 
C)  zero-one integer programming problems. 
D)  goal programming problems. 
E)  nonlinear programming problems. 
A)  pure-integer programming problems. 
B)  mixed-integer programming problems. 
C)  zero-one integer programming problems. 
D)  goal programming problems. 
E)  nonlinear programming problems.

Question 12

Table 10-4
A company has decided to use 0−1 integer programming to help make some investment decisions. There are three possible investment alternatives from which to choose, but if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred (i.e., it is impossible to build one-half of a factory). The integer programming model is as follows:  
-Table 10-4 presents an integer programming problem. If the optimal solution is used, then only two of the alternatives would be selected. How much slack would there be in the third constraint?

Accepted Answer

A)  1000 
B)  5000 
C)  3300 
D)  8000 
E)  None of the above 
A)  1000 
B)  5000 
C)  3300 
D)  8000 
E)  None of the above

Question 13

The concept of a local optimum is affiliated with which of the following?

Accepted Answer

A)  mixed integer programming 
B)  integer programming 
C)  linear programming 
D)  nonlinear programming 
E)  goal programming 
A)  mixed integer programming 
B)  integer programming 
C)  linear programming 
D)  nonlinear programming 
E)  goal programming

Question 14

A 0-1 programming representation could be used to assign sections of a course to specific classrooms.

Accepted Answer

A) True 
 B)False

Question 15

If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming problem.

Accepted Answer

A) True 
 B)False

Question 16

The overall best solution in a nonlinear program is a ________.

Accepted Answer

A)  global optimum 
B)  local optimum 
C)  binary optimum 
D)  nonlinear optimum 
E)  goal optimum 
A)  global optimum 
B)  local optimum 
C)  binary optimum 
D)  nonlinear optimum 
E)  goal optimum

Question 17

Table 10-4
A company has decided to use 0−1 integer programming to help make some investment decisions. There are three possible investment alternatives from which to choose, but if it is decided that a particular alternative is to be selected, the entire cost of that alternative will be incurred (i.e., it is impossible to build one-half of a factory). The integer programming model is as follows:  
-Table 10-4 presents an integer programming problem. What is the meaning of Constraint 1?

Accepted Answer

A)  If X1 is selected, X2 must also be selected. 
B)  No more than two alternatives may be selected. 
C)  At least two alternatives must be selected. 
D)  If X2 is selected, X1 must also be selected. 
E)  None of the above 
A)  If X1 is selected, X2 must also be selected. 
B)  No more than two alternatives may be selected. 
C)  At least two alternatives must be selected. 
D)  If X2 is selected, X1 must also be selected. 
E)  None of the above

Question 18

There is no general method for solving all nonlinear problems.

Accepted Answer

A) True 
 B)False

Question 19

A goal programming problem had two goals (with no priorities assigned). Goal number 1 was to achieve a cost of $3,600 and goal number 2 was to have no wasted material. The optimal solution to this problem resulted in a cost of $3,900 and no wasted material. What was the value for the objective function for this goal programming problem?

Accepted Answer

A)  300 
B)  -300 
C)  3300 
D)  0 
E)  None of the above 
A)  300 
B)  -300 
C)  3300 
D)  0 
E)  None of the above

Question 20

State the advantage of goal programming over linear programming.

Accepted Answer

Goal programming all

Goal programming permits multiple objectives to be satisfied.

Consider the following 0-1 integer programming problem: If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?

A type of integer programming is

0-1 integer programming might be applicable to selecting the best gymnastics team to represent a country from among all identified teams.

The following represents a:

Unfortunately, multiple goals in goal programming are not able to be prioritized and solved.

Table 10-2 -According to Table 10-2, which presents a solution for an integer programming problem, at the optimal solution, how much slack exists in the third constraint?

Assignment problems solved previously by linear programming techniques are also examples of

The concept of a local optimum is affiliated with which of the following?

A 0-1 programming representation could be used to assign sections of a course to specific classrooms.

If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming problem.

The overall best solution in a nonlinear program is a ________.

There is no general method for solving all nonlinear problems.

State the advantage of goal programming over linear programming.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation and Assignment Models

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters

Exam 10: Integer Programming, Goal Programming, and Nonlinear Programming

Goal programming permits multiple objectives to be satisfied.

Consider the following 0-1 integer programming problem: If we wish to add the constraint that no more than two of these variables must be positive, how would this be written?

A type of integer programming is

0-1 integer programming might be applicable to selecting the best gymnastics team to represent a country from among all identified teams.

The following represents a:

Unfortunately, multiple goals in goal programming are not able to be prioritized and solved.

Table 10-2 -According to Table 10-2, which presents a solution for an integer programming problem, at the optimal solution, how much slack exists in the third constraint?

Assignment problems solved previously by linear programming techniques are also examples of

The concept of a local optimum is affiliated with which of the following?

A 0-1 programming representation could be used to assign sections of a course to specific classrooms.

If conditions require that all decision variables must have an integer solution, then the class of problem described is an integer programming problem.

The overall best solution in a nonlinear program is a ________.

There is no general method for solving all nonlinear problems.

State the advantage of goal programming over linear programming.

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation and Assignment Models

Network Models

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters