Exam 14: Optimization Models

Multiple optimal solutions are quite common in linear programming models.

In blending problems,if a quality constraint involves a quotient,then the problem will be nonlinear.

In aggregate planning models,we can model backlogging of demand by allowing a month's inventory to be negative.

Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.

When we solve a linear programming problem with Solver,we cannot guarantee that the solution obtained is an optimal solution.

In a minimum cost network flow model,the flow balance constraint for each supply node takes the form

A minimum cost network flow model (MCNFM)has the following advantage relative to the special case of a simple transportation model:

Which of the following does not represent a broad class of applications of linear programming models?

In a set-covering model,each member of a given set (set 1)must be "covered" by an acceptable member of another set (set 2).The objective of such problems is to minimize the number of elements in set 2 that are needed to cover all the elements in set 1.

Any integer programming problem involving 0-1 variables with only one constraint is called a knapsack problem.

The flows in a general minimum cost network flow model (MCNFM)do all necessarily have to be from "left to right";that is,from supply points to demand points.

In an optimized network flow model (MCNFM),all the available capacity will be used.

Transportation and transshipment problems are both considered special cases of a class of linear programming problems called

If all the supplies and demands for a transportation model are integers,then the optimal Solver solution may or may not have integer-valued shipments.

Any integer program involving 0 - 1 variables with constraint(s)is called a knapsack problem.

In a network representation of a transportation problem,the nodes generally represent:

The binary variables in the fixed cost models correspond to:

The constraints in a blending problem can be specified in a valid way and still lead to which of the following problems?

Which of the following statements are false?

In a typical minimum cost network flow model,the nodes indicate