Question 1

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. A

Question 2

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. C

Question 3

The interpretation of the dual price for nonlinear models is different than the interpretation of the dual price for linear models.

Accepted Answer

A) True 
 B)False  False

Question 4

In the case of functions with multiple local optima,most nonlinear optimization software methods can get stuck and terminate at a local optimum.

Accepted Answer

A) True 
 B)False

Question 5

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 6

Financial planner Minnie Margin wishes to develop a mutual fund portfolio based on the Markowitz portfolio model.She needs to determine the proportion of the portfolio to invest in each of the five mutual funds listed below so that the variance of the portfolio is minimized subject to the constraint that the expected return of the portfolio be at least 5%.Formulate the appropriate nonlinear program.​

Accepted Answer

IS = proportion of portfolio invested in

Question 7

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 8

For a typical nonlinear problem,if you change the right-hand side by even a small amount,the dual value changes.

Accepted Answer

A) True 
 B)False

Question 9

Investment manager Max Gaines wishes to develop a mutual fund portfolio based on the Markowitz portfolio model.He needs to determine the proportion of the portfolio to invest in each of the five mutual funds listed below so that the variance of the portfolio is minimized subject to the constraint that the expected return of the portfolio be at least 4%.Formulate the appropriate nonlinear program.​
​

Accepted Answer

IS = proportion of portfolio invested in

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

The value of the coefficient of imitation,q,in the Bass model for forecasting adoption of a new product cannot be negative.

Accepted Answer

A) True 
 B)False

Question 12

The Markowitz mean-variance portfolio model presented in the text is a convex optimization problem.

Accepted Answer

A) True 
 B)False

Question 13

A feasible solution is a global optimum if no other feasible points with a better objective function value are found in the feasible region.

Accepted Answer

A) True 
 B)False

Question 14

When components share a storage facility,they are called

Accepted Answer

A) constrained components. 
B) correlated components. 
C) blended components. 
D) None of these are correct. 
A) constrained components. 
B) correlated components. 
C) blended components. 
D) None of these are correct.

Question 15

Financial planner Minnie Margin has a substantial number of clients who wish to own a mutual fund portfolio that matches,as a whole,the performance of the Russell 2000 index.Her task is to determine what proportion of the portfolio should be invested in each of the five mutual funds listed below so that the portfolio most closely mimics the performance of the Russell 2000 index.Formulate the appropriate nonlinear program.​   ​

Accepted Answer

IS = proportion of portfolio invested in

Question 16

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 17

Nonlinear programming algorithms are more complex than linear programming algorithms.

Accepted Answer

A) True 
 B)False

Question 18

Investment manager Max Gaines has several clients who wish to own a mutual fund portfolio that matches,as a whole,the performance of the S&P 500 stock index.His task is to determine what proportion of the portfolio should be invested in each of the five mutual funds listed below so that the portfolio most closely mimics the performance of the S&P 500 index.Formulate the appropriate nonlinear program.​   ​

Accepted Answer

IS = proportion of portfolio invested in

Question 19

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 20

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

Accepted Answer

A) True 
 B)False

A convex function is

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

The interpretation of the dual price for nonlinear models is different than the interpretation of the dual price for linear models.

In the case of functions with multiple local optima,most nonlinear optimization software methods can get stuck and terminate at a local optimum.

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

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

For a typical nonlinear problem,if you change the right-hand side by even a small amount,the dual value changes.

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

The value of the coefficient of imitation,q,in the Bass model for forecasting adoption of a new product cannot be negative.

The Markowitz mean-variance portfolio model presented in the text is a convex optimization problem.

A feasible solution is a global optimum if no other feasible points with a better objective function value are found in the feasible region.

When components share a storage facility,they are called

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

Nonlinear programming algorithms are more complex than linear programming algorithms.

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

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: Simplex Method

Simplex-Based Sensitivity Analysis and Duality

Solution Procedures for Transportation and Assignment Problems

Minimal Spanning Tree

Dynamic Programming

Filters

Exam 8: Nonlinear Optimization Models

A convex function is

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

The interpretation of the dual price for nonlinear models is different than the interpretation of the dual price for linear models.

In the case of functions with multiple local optima,most nonlinear optimization software methods can get stuck and terminate at a local optimum.

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

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

For a typical nonlinear problem,if you change the right-hand side by even a small amount,the dual value changes.

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

The value of the coefficient of imitation,q,in the Bass model for forecasting adoption of a new product cannot be negative.

The Markowitz mean-variance portfolio model presented in the text is a convex optimization problem.

A feasible solution is a global optimum if no other feasible points with a better objective function value are found in the feasible region.

When components share a storage facility,they are called

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

Nonlinear programming algorithms are more complex than linear programming algorithms.

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

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

Introduction

An Introduction to Linear Programming

Linear Programming: Sensitivity Analysis and Interpretation of Solution

Linear Programming Applications in Marketing, finance, and OM

Advanced Linear Programming Applications

Distribution and Network Models

Integer Linear Programming

Project Scheduling: Pertcpm

Inventory Models

Waiting Line Models

Simulation

Decision Analysis

Multicriteria Decisions

Time Series Analysis and Forecasting

Markov Processes

Linear Programming: 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.