If all of the decision variables require integer solutions, the problem is

1. a pure integer programming type of problem.

2. a simplex method type of problem.

3. a mixed-integer programming type of problem.

4. a Gorsky type of problem.

In a mixed-integer programming problem,

1. some integers must be even and others must be odd.

2. some decision variables must require integer results only and some variables must allow for continuous results.

3. different objectives are mixed together even though they sometimes have relative priorities ­established.

A model containing a linear objective function and linear constraints but requiring that one or more of the decision variables take on an integer value in the final solution is called

1. an integer programming problem.

2. a goal programming problem.

3. a nonlinear programming problem.

4. a multiple objective LP problem.

An integer programming solution can never produce a greater profit than the LP solution to the same problem.

1. True

2. False

In goal programming, if all the goals are achieved, the value of the objective function will always be zero.

1. True

2. False

The objective in a goal programming problem with one priority level is to maximize the sum of the deviational variables.

1. True

2. False

Nobel Laureate Herbert A. Simon of Carnegie-Mellon University says that modern managers should always optimize, not satisfice.

1. True

2. False

The fixed-charge problem is typically classified as

1. a goal programming problem.

2. a 0–1 integer problem.

3. a quadratic programming problem.

4. an assignment problem.

The 0–1 integer programming problem

1. requires the decision variables to have values between 0 and 1.

2. requires all the constraints to have coefficients between 0 and 1.

3. requires the decision variables to have coefficients between 0 and 1.

4. requires the decision variables to be equal to 0 or 1.

Goal programming

1. requires only that you know whether the goal is direct profit maximization or cost minimization.

2. allows you to have multiple goals.

3. is an algorithm with the goal of a quicker solution to the pure integer programming problem.

4. is an algorithm with the goal of a quicker solution to the mixed-integer programming problem.

Nonlinear programming includes

1. problems in which the objective function is linear but some constraints are not linear.

2. problems in which the constraints are linear but the objective function is not linear.

3. problems in which both the objective function and all of the constraints are not linear.

4. problems that are solvable by quadratic programming.

5. all of the above.