Question Completion Status:

Please match the term with the right description.

$$ Redundant constraint

Bounded rationality

Decision tree

Suboptimization

States of nature

Shadow price

Feasible region

Range of feasibility

Simplex method

Slack

A$.$ A constraint describes a requirement for a less than or equal to relationship

B$.$ Either the final value or reduced cost is zero

C$.$ A result of individual departments making the best decisions for their own areas but hurting other areas

D$.$ Possible future conditions

E$.$ The difference between the constraint value and the left$-$hand$-$side value

F$.$ A constraint does not form a unique boundary of the feasible solution space

G$.$ A general$-$purpose LP algorithm that can be used for solving only problems with more than six variables

H$.$ A range over which the right$-$hand$-$side quantity can change without affecting the shadow price of the constraint

A schematic representation of alternatives

J$.$ A range refers to coefficients of the objective function

K$.$ A cause of poor decision making imposed on decision making by costs, time, and technology

L$.$ The set of all feasible combinations of decision variables

M$.$ A matrix representation of alternatives

$N.$ how much a one$-$unit decrease$/$increase in the right$-$hand$-$side value of a constraint will decrease$/$increase the optimal value of the objective function

O$.$ The result of departmentalized decision making