Operations Research MCQs (Set-1)

Operations research applies analytical methods to improve what?

A Surface finish
B Material strength
C Decision making
D Machine color

In a linear program, decision variables represent what?

A Known coefficients
B Choices to determine
C Resource limits
D Model errors

The objective function expresses what?

A Constraint slack only
B Measure to optimize
C Input data source
D Feasible region boundary

A linear-programming constraint represents what?

A Objective value only
B Random error
C Resource or requirement limit
D Decision tree branch

A feasible solution satisfies what?

A Only the objective
B All model constraints
C No nonnegativity rules
D One constraint only

The feasible region contains what?

A Only optimal solutions
B All objective coefficients
C All feasible solutions
D Constraint violations

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

Nonnegativity restrictions require decision variables to be what?

A Less than zero
B Equal to one
C At least zero
D Unbounded always

The graphical method is practical for how many variables?

A Ten variables
B One hundred variables
C Unlimited variables
D Two variables

The simplex method moves between what points?

A Random interior points
B Constraint midpoints
C Infeasible vertices
D Feasible corner points

A slack variable converts a less-than constraint into what?

A Equality
B Inequality reversal
C Objective function
D Integer variable

A surplus variable is subtracted from which constraint type?

A Greater-than constraint
B Less-than constraint
C Equality constraint only
D Objective function

Artificial variables help start simplex for what constraints?

A Only less-than constraints
B Equality or greater-than
C Objective coefficients
D Nonnegativity rules

An unbounded LP has objective values that improve without what?

A Feasible points
B Decision variables
C Constraints
D Finite limit

An infeasible LP has what property?

A No feasible solution
B Multiple optima
C Unbounded objective
D Zero slack only

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

A binding constraint has what slack?

A Maximum slack
B Negative slack
C Infinite slack
D Zero slack

Sensitivity analysis studies effects of changing what?

A Model parameters
B Decision labels
C Graph colors
D Variable names only

The dual of a linear program associates values with what?

A Decision variable labels
B Primal constraints
C Graph axes
D Objective units only

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

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

Integer programming requires selected variables to be what?

A Continuous only
B Integer-valued
C Negative only
D Equal to objective

A binary variable can take which values?

A Any real number
B Only negative values
C Any integer
D Zero or one

Goal programming handles multiple what?

A Competing objectives
B Constraint equations only
C Random arrivals
D Transport routes

A nonlinear program has what feature?

A Only integer variables
B No objective function
C Nonlinear model relation
D No constraints