MCQs on Linear Programming Problems

Which of the following is a key assumption of linear programming?

• Non-linearity

• Discrete variables

• Proportionality

• Randomness

In a standard linear programming problem, the objective function is:

• Always quadratic

• Always nonlinear

• Linear and either maximized or minimized

• Constant

Which method is commonly used to solve a two-variable linear programming problem graphically?

• Simplex Method

• Big-M Method

• Dual Simplex Method

• Graphical Method

In linear programming, a feasible solution is:

• One that maximizes profit

• One that satisfies all constraints

• One that violates at least one constraint

• Always unique

The region that satisfies all the constraints in a linear programming problem is called:

• Optimal solution

• Decision region

• Objective function

• Feasible region

The optimal solution to a linear programming problem always occurs:

• At the center of the feasible region

• Along the objective function

• At a corner (extreme) point of the feasible region

• Outside the feasible region

If a linear programming problem has more than one optimal solution, it is called:

• Unbounded

• Infeasible

• Degenerate

• Multiple optimal solutions

Which of the following methods is most suitable for solving large-scale linear programming problems?

• Trial-and-error

• Graphical method

• Simplex method

• Enumeration

A constraint in linear programming must be expressed as:

• A non-linear equation

• An objective function

• A linear equation or inequality

• A random variable

In LPP, if no point satisfies all constraints, the problem is said to be:

• Unbounded

• Feasible

• Infeasible

• Degenerate