Linear Programming MCQs
Linear Programming MCQs
These Linear Programming multiple-choice questions and their answers will help you strengthen your grip on the subject of Linear Programming. You can prepare for an upcoming exam or job interview with these Linear Programming MCQs.
So scroll down and start answering.
1: The objective function values in the graphical solution method to linear programming problems.This statement is related to
A. Shortest processing time
B. Sequencing
C. Binding constraints
D. Theory of constraints
2: Which of correct statement about Constraints
A. An approach in linear programming
B. A method by which parallel cost lines are plotted in the LP graphical solution
C. The limited availability of resources
D. Both b & c
3: Corner point solution method an approach in ________
A. Procedural Programming
B. Functional Programming
C. Scripting Programming
D. Linear programming
4: _______ in an LP model such as production levels, purchase quantities, and shipping routes that are under the control of the decision maker
A. Decision variables
B. Moderating variables
C. Control variables
D. Extraneous variables
5: A method by which parallel cost lines are plotted in the LP graphical solution approach to determine the least cost solution to LP problems with cost minimization objective is known as
A. Iso-cost line method
B. Iso-profit line method
C. Linear relationship
D. None of these
6: Iso-profit line method determine the maximum profit solution to LP problems with profit maximization objective
A. True
B. False
7: In Linear relationship the effect of changing a decision variable is proportional to its ______
A. Time
B. Value
C. Quality
D. Magnitude
8: Multiple optimum solutions every combination of values of the decision variables that falls on that segment of the constraint line
A. True
B. False
9: Which is the correct statement of Objective function ?
A. The objective of an LP problem expressed mathematically
B. The limited range over which the shadow price remains constant
C. The range of values of the objective function within which the optimal values of the decision variables will not change
D. None of these
10: Range of feasibility is the limited range over which the shadow price ______
A. Remains constant
B. Large
C. Small
D. Both a & c
11: The range of values of the objective function within which the optimal values of the decision variables will not change is known as
A. Range of optimality
B. Range of feasibility
C. Redundant constraints
D. Shadow price or dual price
12: Constraints in an LP problem that do not affect the boundaries of the feasible solution region is known as
A. Range of optimality
B. Range of feasibility
C. Redundant constraints
D. Shadow price or dual price
13: _______ determination in the LP technique of how sensitive the current optimal solution is to changes in the input parameter values
A. Sensitivity or post-optimality analysis
B. Shadow price or dual price
C. Simplex method
D. BOTH A & B
14: Which Statement is correct about Shadow price or dual price
A. Determine the optimal value of the objective function
B. It is the price one would be willing to pay for acquiring an additional unit of that resource
C. The amount by which the left-hand-side values are less than the right-hand-side values in LP constraints
D. All are related to Shadow price or dual price
15: Simplex method provides a systematic way of examining the corner or extreme points of the feasible region of more complex LP problems
A. True
B. False
16: The amount by which the left-hand-side values are less than the right-hand-side values in LP constraints is known as
A. Slack
B. Surplus
C. Both a & b
D. None of these
17: ______ the amount by which the left-hand-side values are greater than the right-hand-side values in LP constraints
A. Slack
B. Surplus
C. Both a & b
D. None of these
18: The constraints that form the corner points at the boundaries of the feasible solution region are known as ______.
A. Redundant constraints
B. Surplus constraints
C. Binding constraints
D. Infinite constraints
19: ______ is a method by which parallel profit lines are plotted in the LP graphical solution approach to determine the maximum profit solution to LP problems with profit maximization objective.
A. Corner point solution method
B. Iso-cost line method
C. Iso-profit line method
D. Multiple optimum solutions
20: The range of values of the objective function within which the best values of the decision variables will not change is known as the ______.
A. Range of optimality
B. Range of feasibility
C. Linear relationship
D. Iso-profit line
21: Every linear programming problem will have an ______ that needs to be either maximized or minimized.
A. Objective
B. Decision
C. Variable
D. Function
22: ______ arise because resources are scarce and decisions have to be made within the limitations imposed by this scarcity.
A. Slack
B. Surplus
C. Constraints
D. Objective function
23: ______ is the effect of changing a decision variable that is proportional to its magnitude.
A. Corner point
B. Linear relationship
C. Iso-profit line
D. Range of optimality
24: ______ has been applied in a variety of industries to address a variety of problems.
A. Linear programming
B. Iso-profit line
C. Range of feasibility
D. Corner point
25: ______ is the amount by which the left-hand side values are less than the right-hand side values.
A. Slack
B. Surplus
C. Constraints
D. Objective function
26: The ______ in linear programming are alternative courses of action.
A. Redundant constraints
B. Sensitivity
C. Range of feasibility
D. Decision variables
27: ______ is the determination of how subtle the current optimal solution is to changes in the input parameter values.
A. Iso-profit line
B. Range of feasibility
C. Linear relationship
D. Sensitivity
28: ______ is the variety of values of the objective function within which the best values of the decision variables will not change.
A. Iso-profit line
B. Range of feasibility
C. Linear relationship
D. Range of optimality
29: ______ are constraints in a linear programming problem that do not affect the boundaries of the feasible solution region.
A. Corner point
B. Iso-profit line
C. Redundant constraints
D. Range of optimality
30: If there were no ______ on the availability of resources, linear programming would not be needed as a decision-making tool.
A. Restrictions
B. Visibility
C. Decisions
D. Slack
31: A(n) ___________ solution satisfies all the constraint expressions simultaneously.
A. Bjective
B. Extreme
C. Feasible
D. Infeasible
32: Each october the oig releases a ____ outlining its priorities for the fiscal year ahead.
A. Compliance Plan
B. Work Plan
C. Self-referral laws
D. CIA yearly review
List of Linear Programming MCQ...
Available in:
Linear Programming MCQs
