AGEC 4603 Final Ch 9

Ch. 9
1) The different objectives in a goal programming problem are referred to as goals.
Answer: TRUE

2) All goal constraints are inequalities that include deviational variables.
Answer: FALSE

3) A negative deviational variable is the amount by which a goal level is exceeded.
Answer: FALSE

4) At least one or both deviational variables in a goal constraint must equal 0.
Answer: TRUE

5) The objective function in a goal programming model seeks to minimize the deviation from
goals in the order of the goal priorities.
Answer: TRUE

6) In goal programming, terms are summed in the objective function in order to make consistent
decisions.
Answer: FALSE

7) Goal constraints can include all deviational variables.
Answer: TRUE

8) In goal programming, problems cannot have two or more goals at the same priority level.
Answer: FALSE

9) Goal programming provides a method for simultaneously striving to achieve several
objectives.
Answer: TRUE

10) A requirement for the solution procedure for the goal programming problem is that all goals
must be achieved.
Answer: FALSE

11) One goal is never achieved at the expense of another higher-priority goal.
Answer: TRUE

12) A goal can be achieved at the expense of another lower-priority goal.
Answer: TRUE

13) Goal programming solutions do not always achieve all goals.
Answer: TRUE

14) In a goal programming model, the terms in the objective function are summed to determine
the maximum profit or minimum cost.
Answer: FALSE

15) Objective function terms are not summed in goal programming because not all goals are
achievable.
Answer: FALSE

,16) Goal programming violates the divisibility property of linear programming.
Answer: FALSE

17) In a pairwise comparison, two alternatives are compared according to a criterion and one is
preferred.
Answer: TRUE

18) A preference scale assigns numerical values to different levels of preference.
Answer: TRUE

19) On a preference scale for pairwise comparisons, the number "1" indicates that two objects
are equally preferred.
Answer: TRUE

20) A pairwise comparison matrix summarizes the pairwise comparisons for a criterion.
Answer: TRUE

21) In synthesization, decision alternatives are prioritized within each criterion.
Answer: TRUE

22) A consistency index measures the degree of inconsistency in pairwise comparisons.
Answer: TRUE

23) A preference scale assigns numerical values to different levels of preferences.
Answer: TRUE

24) In a given AHP problem, the consistency index is .15, and the random index is .90. In this
instance, there are probably serious inconsistencies and, therefore, the AHP result may not be
meaningful.
Answer: TRUE

25) A scoring model is more subjective than the analytical hierarchy process.
Answer: TRUE

26) Scoring models use consistency indexes to measure the degree of consistency between
choices.
Answer: FALSE

27) In scoring models, the two alternatives with the highest scores are compared to make the
final decision.
Answer: FALSE

Ch 10
1) The slope of a curve at any point is equal to the derivative of the curves function.
Answer: TRUE

2) The slope of a curve at its highest point equals 1.
Answer: FALSE

, 3) A profit function of Z = 3x2 - 12x + 5 reaches maximum profit at x = 2 units of output.
Answer: TRUE

4) Classical optimization uses calculus to determine the optimal values of a variable.
Answer: TRUE

5) A firm has a cost function of 3x2 - 25x + 374. Without having two examples of their output
volume and total cost, we cannot determine their fixed cost.
Answer: FALSE

6) Maximum profit is achieved everywhere the first derivative of the profit function equals zero.
Answer: FALSE

7) The first derivative of a cost function equals zero at the point V = 100. This is definitely the
worst output volume for the producer to choose.
Answer: FALSE

8) Decision variables cannot be multiplied by each other in the objective function of a nonlinear
program.
Answer: FALSE

9) Both linear and nonlinear programming models are examples of constrained optimization
models.
Answer: TRUE

10) An optimal solution to a nonlinear programming problem will always occur at the boundary
of the feasible solution space formed by the constraint.
Answer: FALSE

11) The Lagrange multiplier is analogous to the dual variables in a linear programming problem.
Answer: TRUE

12) The Lagrange multiplier at the optimum gives only the instantaneous rate of change in the
objective value.
Answer: TRUE

13) Both linear and nonlinear programming models have the general form of an objective
function subject to more than 1 constraint.
Answer: FALSE

14) Classical optimization is the use of calculus to determine the optimal value of a variable.
Answer: TRUE

15) If a nonlinear program has been correctly formulated, procedures guarantee a solution.
Answer: FALSE

16) In an unconstrained nonlinear programming problem, we have a single nonlinear objective
function and no constraints..
Answer: TRUE