Question

1. If a problem is referred to as a linear programming problem, what must be true?

A) the objective function must be linear

B) both the objective function and the constraints must be linear

C) the constraints must be linear

D) the decision variables must be linear

2. Three essential elements of a linear programming formulation are the:

A) decision variables, feasibility, constraints

B) constraints, objective function, non-negativity

C) decision variables, objective function, constraints

D) objective function, constraints, solution

3. When constraints identify mutually exclusive (non-intersecting) feasible regions, the result is:

A) infeasibility

B) alternate optimal solutions

C) unbounded solutions

D) multiple objective coefficients

4. The feasible region identified in a graphical solution:

A) consists of positive coordinates only

B) is defined by the line representing the objective function

C) is defined by the constraints

D) none of the above

5. An example of an objective coefficient is:

A) demand for product X

B) warehouse space available for product X

C) profit per unit for product X

D) proportion of product X to product Y

Answer 1

Q.1 ans: B) both the objective function and the constraints must be linear

Q.2 answer :
Three essential elements of a linear programming formulation are the:
C) decision variables, objective function, and constraints.

Q.3 answer :
When constraints identify mutually exclusive (non-intersecting) feasible regions, the result is:
A) infeasibility

Q.4 answer :
The feasible region identified in a graphical solution:
C) is defined by the constraints.

Q.5 answer :
An example of an objective coefficient is:
C) profit per unit for product X

PL??