Question 1

Any feasible solution to a blending problem without pooled components is feasible to the problem with pooled components.

Accepted Answer

A) True 
 B)False  False

Question 2

When the number of blending components exceeds the number of storage facilities, the number of feasible solutions to the blending problem

Accepted Answer

A) is reduced. 
B) is increased. 
C) is unchanged. 
D) is zero. 
A) is reduced. 
B) is increased. 
C) is unchanged. 
D) is zero. A

Question 3

Which of the following is not a parameter of the Bass model for forecasting adoption of a new product?

Accepted Answer

A) the coefficient of innovation 
B) the coefficient of interaction 
C) the coefficient of imitation 
D) the estimated number of people to eventually adopt the new product 
A) the coefficient of innovation 
B) the coefficient of interaction 
C) the coefficient of imitation 
D) the estimated number of people to eventually adopt the new product B

Question 4

The function f (X, Y) = X 2 + Y 2 has a single global minimum and is relatively easy to minimize.

Accepted Answer

A) True 
 B)False

Question 5

Components that share a storage facility are called

Accepted Answer

A) constrained components. 
B) indexed components. 
C) blended components. 
D) pooled components. 
A) constrained components. 
B) indexed components. 
C) blended components. 
D) pooled components.

Question 6

A nonlinear optimization problem is any optimization problem in which at least one term in the objective function or a constraint is nonlinear.

Accepted Answer

A) True 
 B)False

Question 7

Many linear programming algorithms such as the simplex method optimize by examining only the extreme points of the feasible region.

Accepted Answer

A) True 
 B)False

Question 8

A function is quadratic if its nonlinear terms have a power of 4.

Accepted Answer

A) True 
 B)False

Question 9

The problem of maximizing a concave quadratic function over a linear constraint set is relatively difficult to solve.

Accepted Answer

A) True 
 B)False

Question 10

A convex function is

Accepted Answer

A) bowl-shaped up. 
B) bowl-shaped down. 
C) elliptical in shape. 
D) sinusoidal in shape. 
A) bowl-shaped up. 
B) bowl-shaped down. 
C) elliptical in shape. 
D) sinusoidal in shape.

Question 11

Which of the following is not true regarding a concave function?

Accepted Answer

A) It is bowl-shaped down. 
B) It is relatively easy to maximize. 
C) It has multiple local maxima. 
D) It has a single global maximum. 
A) It is bowl-shaped down. 
B) It is relatively easy to maximize. 
C) It has multiple local maxima. 
D) It has a single global maximum.

Question 12

Which of the following is incorrect?

Accepted Answer

A) A global optimum is a local optimum in a nonlinear optimization problem. 
B) A local maximum is a global maximum in a concave nonlinear optimization problem. 
C) A global minimum is a local minimum in a convex nonlinear optimization problem. 
D) A local optimum is a global optimum in a nonlinear optimization problem. 
A) A global optimum is a local optimum in a nonlinear optimization problem. 
B) A local maximum is a global maximum in a concave nonlinear optimization problem. 
C) A global minimum is a local minimum in a convex nonlinear optimization problem. 
D) A local optimum is a global optimum in a nonlinear optimization problem.

Question 13

Nonlinear optimization problems can have only one local optimal solution.

Accepted Answer

A) True 
 B)False

Question 14

The key idea behind constructing an index fund is to choose a portfolio of securities that

Accepted Answer

A) is a mix of growth-oriented and income-oriented stocks. 
B) minimizes risk without sacrificing liquidity. 
C) mimics the performance of a broad market index. 
D) balances short-term and long-term investments. 
A) is a mix of growth-oriented and income-oriented stocks. 
B) minimizes risk without sacrificing liquidity. 
C) mimics the performance of a broad market index. 
D) balances short-term and long-term investments.

Question 15

Because most nonlinear optimization codes will terminate with a local optimum, the solution returned by the codes will be the best solution.

Accepted Answer

A) True 
 B)False

Question 16

Any feasible solution to a blending problem with pooled components is feasible to the problem with no pooling.

Accepted Answer

A) True 
 B)False

Question 17

If the coefficient of each squared term in a quadratic function is positive, the function is

Accepted Answer

A) concave. 
B) convex. 
C) elliptical. 
D) sinusoidal. 
A) concave. 
B) convex. 
C) elliptical. 
D) sinusoidal.

Question 18

A feasible solution is a global optimum if there are no other feasible solutions with a better objective function value in the immediate neighborhood.

Accepted Answer

A) True 
 B)False

Question 19

When components (or ingredients) in a blending problem must be pooled, the number of feasible solutions is reduced.

Accepted Answer

A) True 
 B)False

Question 20

An investor can pick the mean-variance tradeoff that he or she is most comfortable with by looking at a graph of the

Accepted Answer

A) feasible region. 
B) pooled components. 
C) rolling horizon. 
D) efficient frontier. 
A) feasible region. 
B) pooled components. 
C) rolling horizon. 
D) efficient frontier.

Exam 8: Nonlinear Optimization Models

Any feasible solution to a blending problem without pooled components is feasible to the problem with pooled components.

When the number of blending components exceeds the number of storage facilities, the number of feasible solutions to the blending problem

Which of the following is not a parameter of the Bass model for forecasting adoption of a new product?

The function f (X, Y) = X 2 + Y 2 has a single global minimum and is relatively easy to minimize.

Components that share a storage facility are called

A nonlinear optimization problem is any optimization problem in which at least one term in the objective function or a constraint is nonlinear.

Many linear programming algorithms such as the simplex method optimize by examining only the extreme points of the feasible region.

A function is quadratic if its nonlinear terms have a power of 4.

The problem of maximizing a concave quadratic function over a linear constraint set is relatively difficult to solve.

A convex function is

Which of the following is not true regarding a concave function?

Which of the following is incorrect?

Nonlinear optimization problems can have only one local optimal solution.

The key idea behind constructing an index fund is to choose a portfolio of securities that

Because most nonlinear optimization codes will terminate with a local optimum, the solution returned by the codes will be the best solution.

Any feasible solution to a blending problem with pooled components is feasible to the problem with no pooling.

If the coefficient of each squared term in a quadratic function is positive, the function is

A feasible solution is a global optimum if there are no other feasible solutions with a better objective function value in the immediate neighborhood.

When components (or ingredients) in a blending problem must be pooled, the number of feasible solutions is reduced.

An investor can pick the mean-variance tradeoff that he or she is most comfortable with by looking at a graph of the

Introduction

Introduction to Linear Programming

LP Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications

Advanced Linear Programming Applications

Distribution and Network Problems

Integer Linear Programming

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Forecasting

Markov Processes

LP: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

The function f (X, Y) = X ² + Y ² has a single global minimum and is relatively easy to minimize.