Operations research applies analytical methods to improve what?
A Surface finish
B Material strength
C Decision making
D Machine color
Answer: C. Decision making. Operations research uses models and data to support better decisions.
In a linear program, decision variables represent what?
A Known coefficients
B Choices to determine
C Resource limits
D Model errors
Answer: B. Choices to determine. Decision variables are the unknown choices optimized by the model.
The objective function expresses what?
A Constraint slack only
B Measure to optimize
C Input data source
D Feasible region boundary
Answer: B. Measure to optimize. The objective function is maximized or minimized.
A linear-programming constraint represents what?
A Objective value only
B Random error
C Resource or requirement limit
D Decision tree branch
Answer: C. Resource or requirement limit. Constraints encode available resources or required conditions.
A feasible solution satisfies what?
A Only the objective
B All model constraints
C No nonnegativity rules
D One constraint only
Answer: B. All model constraints. A feasible solution meets every constraint and variable restriction.
The feasible region contains what?
A Only optimal solutions
B All objective coefficients
C All feasible solutions
D Constraint violations
Answer: C. All feasible solutions. The feasible region is the set of points satisfying every constraint.
An optimal solution gives the best objective value among what?
A Feasible solutions
B All possible values
C Infeasible points
D Only integer points always
Answer: A. Feasible solutions. An optimum is a feasible solution with the best objective value.
Nonnegativity restrictions require decision variables to be what?
A Less than zero
B Equal to one
C At least zero
D Unbounded always
Answer: C. At least zero. Nonnegativity rules prevent negative decision quantities when physically inappropriate.
The graphical method is practical for how many variables?
A Ten variables
B One hundred variables
C Unlimited variables
D Two variables
Answer: D. Two variables. A two-dimensional graph can show constraints and objective lines for two variables.
The simplex method moves between what points?
A Random interior points
B Constraint midpoints
C Infeasible vertices
D Feasible corner points
Answer: D. Feasible corner points. Simplex searches adjacent extreme points of the feasible polytope.
A slack variable converts a less-than constraint into what?
A Equality
B Inequality reversal
C Objective function
D Integer variable
Answer: A. Equality. Slack measures unused resource in a ≤ constraint.
A surplus variable is subtracted from which constraint type?
A Greater-than constraint
B Less-than constraint
C Equality constraint only
D Objective function
Answer: A. Greater-than constraint. A surplus variable converts a ≥ constraint to equality by subtracting excess.
Artificial variables help start simplex for what constraints?
A Only less-than constraints
B Equality or greater-than
C Objective coefficients
D Nonnegativity rules
Answer: B. Equality or greater-than. Artificial variables create an initial basis when slack variables cannot.
An unbounded LP has objective values that improve without what?
A Feasible points
B Decision variables
C Constraints
D Finite limit
Answer: D. Finite limit. An unbounded model allows indefinite objective improvement within its constraints.
An infeasible LP has what property?
A No feasible solution
B Multiple optima
C Unbounded objective
D Zero slack only
Answer: A. No feasible solution. Infeasibility means the constraints have no common solution.
Alternate optima occur when what?
A No feasible point exists
B Objective is unbounded
C Multiple solutions share best value
D All variables are integers
Answer: C. Multiple solutions share best value. More than one feasible point yields the same optimal objective value.
A binding constraint has what slack?
A Maximum slack
B Negative slack
C Infinite slack
D Zero slack
Answer: D. Zero slack. A binding constraint is exactly active at the optimum.
Sensitivity analysis studies effects of changing what?
A Model parameters
B Decision labels
C Graph colors
D Variable names only
Answer: A. Model parameters. Sensitivity analysis examines how data changes affect the optimal solution.
The dual of a linear program associates values with what?
A Decision variable labels
B Primal constraints
C Graph axes
D Objective units only
Answer: B. Primal constraints. Dual variables correspond to primal constraints and represent marginal resource values.
A shadow price estimates objective improvement from one more unit of what?
A Resource availability
B Decision variable label
C Constraint count
D Graph scale
Answer: A. Resource availability. A shadow price is the marginal objective value of relaxing a constraint.
Reduced cost indicates improvement needed for a variable to do what?
A Become a constraint
B Change units
C Become an objective
D Enter the solution
Answer: D. Enter the solution. Reduced cost indicates the objective coefficient change needed for a nonbasic variable to become attractive.
Integer programming requires selected variables to be what?
A Continuous only
B Integer-valued
C Negative only
D Equal to objective
Answer: B. Integer-valued. Integer programming restricts some or all decision variables to integer values.
A binary variable can take which values?
A Any real number
B Only negative values
C Any integer
D Zero or one
Answer: D. Zero or one. Binary variables model yes-no or on-off decisions.
Goal programming handles multiple what?
A Competing objectives
B Constraint equations only
C Random arrivals
D Transport routes
Answer: A. Competing objectives. Goal programming minimizes deviations from multiple target goals.
A nonlinear program has what feature?
A Only integer variables
B No objective function
C Nonlinear model relation
D No constraints
Answer: C. Nonlinear model relation. At least one objective or constraint is nonlinear.