Question 1

Stages in a dynamic programming problem might represent any of the following except:

Accepted Answer

A) system states. 
B) time, in months. 
C) projects. 
D) "knapsack" items. 
A) system states. 
B) time, in months. 
C) projects. 
D) "knapsack" items.

Question 2

Which of the following is not a true description of concave functions?

Accepted Answer

A) No sharp points or discontinuities. 
B) A single peak. 
C) A line between two points on the curve will lie on or below the curve. 
D) Nonlinear. 
A) No sharp points or discontinuities. 
B) A single peak. 
C) A line between two points on the curve will lie on or below the curve. 
D) Nonlinear.

Question 3

As part of its Welfare to Work program, the Georgia legislature has allocated $28,800,000 to a new program designed to get skilled and unskilled workers off welfare.Unskilled workers would be paid $7.20 per hour whereas skilled workers would be paid $12.00 per hour under this program.The goals of the program are: (1) to generate at least 2,000,000 man-hours of work;(2) having at least as many skilled hours as unskilled hours; and, (3) utilize no more than 800,000 skilled hours (beyond that it will be "make work".)
A.Formulate this problem as a preemptive goal programming model.
B.What is the optimal allocation of hours for this situation.

Accepted Answer

A.(P1: MIN U₁ P2: MIN U₂ P3: MIN E₃ S.T.7.

Question 4

In a convex programming problem, while the objective function can have any shape, the set of constraints must form a convex set.

Accepted Answer

A) True 
 B)False

Question 5

LaGrange multipliers are:

Accepted Answer

A) partial derivatives. 
B) nonzero only for an optimal solution. 
C) shadow prices. 
D) used to verify feasibility. 
A) partial derivatives. 
B) nonzero only for an optimal solution. 
C) shadow prices. 
D) used to verify feasibility.

Question 6

Dynamic programming is so named because:

Accepted Answer

A) optimal solutions derived change over time. 
B) it deals with multistage scenarios. 
C) its parameters are not constant. 
D) it allows for a range of decisions. 
A) optimal solutions derived change over time. 
B) it deals with multistage scenarios. 
C) its parameters are not constant. 
D) it allows for a range of decisions.

Question 7

Sootaway Chimney Cleaners has a preemptive goal programming model for their three goals: reduce cost, reduce personnel, and raise quality.If goal 2 has a higher priority than goal 3, it is not possible for goal 3 to be met unless goal 2 has been met first.

Accepted Answer

A) True 
 B)False

Question 8

The optimal solution to a constrained nonlinear programming problem __________ occur at a boundary point.

Accepted Answer

A) must 
B) cannot 
C) need not 
D) should not 
A) must 
B) cannot 
C) need not 
D) should not

Question 9

Simply put, Bellman's principle of optimality states that the
optimal path to the end of the process does not depend upon how the
current state was reached.

Accepted Answer

A) True 
 B)False

Question 10

LaGrange multipliers are like shadow prices in that they give the "instantaneous" change to the objective function value for changes to right hand side coefficients.

Accepted Answer

A) True 
 B)False

Question 11

In goal programming, the multiple objectives (goals) must be:

Accepted Answer

A) complementary. 
B) conflicting. 
C) preemptive. 
D) prioritized. 
A) complementary. 
B) conflicting. 
C) preemptive. 
D) prioritized.

Question 12

Under what conditions would you choose to use a standard linear programming technique for a nonlinear programming problem?

Accepted Answer

(If the relationships in a given problem

Question 13

Briefly describe the concept of backwards recursion in the dynamic programming solution approach.

Accepted Answer

(Backwards recursion starts solving the

Stages in a dynamic programming problem might represent any of the following except:

Which of the following is not a true description of concave functions?

In a convex programming problem, while the objective function can have any shape, the set of constraints must form a convex set.

LaGrange multipliers are:

Dynamic programming is so named because:

Sootaway Chimney Cleaners has a preemptive goal programming model for their three goals: reduce cost, reduce personnel, and raise quality.If goal 2 has a higher priority than goal 3, it is not possible for goal 3 to be met unless goal 2 has been met first.

The optimal solution to a constrained nonlinear programming problem __________ occur at a boundary point.

Simply put, Bellman's principle of optimality states that the optimal path to the end of the process does not depend upon how the current state was reached.

LaGrange multipliers are like shadow prices in that they give the "instantaneous" change to the objective function value for changes to right hand side coefficients.

In goal programming, the multiple objectives (goals) must be:

Under what conditions would you choose to use a standard linear programming technique for a nonlinear programming problem?

Briefly describe the concept of backwards recursion in the dynamic programming solution approach.

Introduction to Management Science Models

Introduction to Management Science Models

Applications of Linear and Integer Programming Models

Network Models

Project Scheduling Models

Decision Models

Forecasting

Inventory Models

Queuing Models

Simulation Models

Quality Management Models

Markov Process Models

Filters

Exam 13: Nonlinear Models:dynamic, Goal, and Nonlinear Programming

Stages in a dynamic programming problem might represent any of the following except:

Which of the following is not a true description of concave functions?

In a convex programming problem, while the objective function can have any shape, the set of constraints must form a convex set.

LaGrange multipliers are:

Dynamic programming is so named because:

Sootaway Chimney Cleaners has a preemptive goal programming model for their three goals: reduce cost, reduce personnel, and raise quality.If goal 2 has a higher priority than goal 3, it is not possible for goal 3 to be met unless goal 2 has been met first.

The optimal solution to a constrained nonlinear programming problem __________ occur at a boundary point.

Simply put, Bellman's principle of optimality states that the optimal path to the end of the process does not depend upon how the current state was reached.

LaGrange multipliers are like shadow prices in that they give the "instantaneous" change to the objective function value for changes to right hand side coefficients.

In goal programming, the multiple objectives (goals) must be:

Under what conditions would you choose to use a standard linear programming technique for a nonlinear programming problem?

Briefly describe the concept of backwards recursion in the dynamic programming solution approach.

Introduction to Management Science Models

Introduction to Management Science Models

Applications of Linear and Integer Programming Models

Network Models

Project Scheduling Models

Decision Models

Forecasting

Inventory Models

Queuing Models

Simulation Models

Quality Management Models

Markov Process Models

Filters