Linear Programming MCQs for BCA

1. What is the main objective of Linear Programming?

A. To minimize variables

B. To find approximate solutions

C. To maximize or minimize a linear objective function

D. To solve nonlinear equations

Answer: C

Explanation: The main goal is to optimize (maximize or minimize) a linear objective function under given

constraints.

2. In a Linear Programming Problem (LPP), constraints are always expressed as:

A. Linear equations or inequalities

B. Non-linear equations

C. Polynomial equations

D. Exponential functions

Answer: A

Explanation: LPP deals only with linear constraints and objective functions.

3. The feasible region in LPP is always:

A. Circular

B. A straight line

C. Convex

D. Concave

Answer: C

Explanation: The feasible region formed by linear constraints is always convex.

4. Which method is used to solve a two-variable LPP graphically?

A. Simplex Method

B. Transportation Method

C. Graphical Method

D. Dual Method

Answer: C

Explanation: Graphical Method is used for solving 2-variable LPP by plotting constraints on graph paper.

5. The condition that all decision variables must be greater than or equal to zero is known as:
A. Linear constraint

B. Objective condition

C. Feasibility condition

D. Non-negativity condition

Answer: D

Explanation: LPP problems require all variables to be non-negative.

6. The point that satisfies all constraints of an LPP is called:

A. Boundary point

B. Infeasible point

C. Feasible solution

D. Objective point

Answer: C

Explanation: A feasible solution lies within or on the boundary of the feasible region.

7. The optimal solution of an LPP lies:

A. Inside the feasible region

B. At the center of the feasible region

C. At one of the corner points (extreme points)

D. At infinity

Answer: C

Explanation: In LPP, the optimal solution always lies at a corner (vertex) of the feasible region.

8. The Simplex method is used for solving:

A. Only graphical problems

B. LPPs with more than two variables

C. Non-linear programming

D. Matrix multiplication

Answer: B

Explanation: Simplex is an algebraic method used when graphical methods are not feasible (more than 2

variables).

9. In a maximization LPP, if all values of the objective function increase infinitely, the solution is

called:

A. Optimal

B. Infeasible
C. Unbounded

D. Feasible

Answer: C

Explanation: An unbounded solution occurs when there is no limit to the value of the objective function.

10. In the Simplex method, the table used for iterations is called:

A. Matrix table

B. Pivot table

C. Simplex tableau

D. Linear matrix

Answer: C

Explanation: Simplex tableau is the structured table used in each step of the Simplex method.

11. Which of the following is NOT an assumption of Linear Programming?

A. Linearity

B. Certainty

C. Infinite solutions

D. Additivity

Answer: C

Explanation: LPP assumes a finite set of feasible solutions. Infinite solutions are not a general assumption.

12. The dual of a minimization problem is always:

A. Another minimization problem

B. A non-linear problem

C. A maximization problem

D. Cannot be determined

Answer: C

Explanation: The dual of a minimization problem is a maximization problem and vice versa.

13. In the dual simplex method:

A. Primal is feasible but not optimal

B. Dual is feasible but not optimal

C. Solution is always infeasible

D. Both primal and dual are infeasible

Answer: B

Explanation: In dual simplex, the solution satisfies optimality but not feasibility.
14. What type of problem is solved using the Hungarian method?

A. Transportation Problem

B. Assignment Problem

C. Dual Problem

D. Simplex Problem

Answer: B

Explanation: Hungarian method is specifically used for solving assignment problems.

15. Which of the following is true about Transportation Problems?

A. Supply must equal demand

B. Objective is to maximize profit

C. It's a non-linear problem

D. It has no constraints

Answer: A

Explanation: Transportation problems assume supply equals demand; otherwise, dummy rows/columns are

added.

16. If an LPP has no feasible solution, it means:

A. Objective function is wrong

B. Constraints are inconsistent

C. Graph is circular

D. Problem has infinite solutions

Answer: B

Explanation: No feasible solution means constraints conflict and don't form a common feasible region.

17. Which statement is correct about the Assignment Problem?

A. It is a special case of Transportation Problem

B. It uses the Graphical Method

C. It uses Simplex Method

D. It only works for maximization

Answer: A

Explanation: Assignment problem is a special case of transportation with cost minimization.

18. In the Simplex method, the entering variable is selected based on:

A. Highest cost

B. Most negative value in Z-row

D. Random selection

Answer: B

Explanation: The entering variable is chosen by the most negative coefficient in the objective function row.

19. In the Simplex tableau, the key element (pivot) is used to:

A. Remove a variable

B. Swap rows

C. Perform row operations for next iteration

D. Increase constraints

Answer: C

Explanation: The pivot is used to update the tableau for the next iteration in Simplex method.

20. Degeneracy in an LPP occurs when:

A. Two solutions are equal

B. More than one solution exists

C. A basic variable takes value zero

D. All variables are non-basic

Answer: C

Explanation: Degeneracy happens when a basic variable becomes zero in the simplex tableau.

21. In the graphical method, if two constraints intersect at a point, that point is called:

A. Optimal point

B. Infeasible point

C. Corner point

D. Dummy point

Answer: C

Explanation: When two constraints intersect, they form a corner (extreme) point.

22. If multiple optimal solutions exist in LPP, then the objective function line:

A. Is parallel to one of the constraints

B. Passes through more than one corner point

C. Is vertical

D. Has a slope of zero

Answer: B

Explanation: Multiple optimal solutions occur when the objective function passes through more than one
vertex of the feasible region.

23. Which algorithm is used to find an initial feasible solution to a Transportation Problem?

A. North-West Corner Method

B. Simplex Method

C. Hungarian Method

D. Gauss Elimination

Answer: A

Explanation: NW Corner is a basic method to find an initial feasible solution for transportation problems.

24. Vogel's Approximation Method (VAM) gives:

A. An infeasible solution

B. The final optimal solution

C. A better initial feasible solution

D. A graphical solution

Answer: C

Explanation: VAM gives a better (closer to optimal) initial feasible solution compared to NW corner method.

25. A feasible solution which optimizes the objective function is called:

A. Dummy solution

B. Basic feasible solution

C. Optimal solution

D. Infeasible solution

Answer: C

Explanation: Among all feasible solutions, the one that gives the best (maximum/minimum) value is optimal.

26. Which of the following is a limitation of Linear Programming?

A. Only one constraint allowed

B. Only minimization problems

C. Assumes linearity of relationships

D. Can't be used in real life

Answer: C

Explanation: LPP assumes linear relationships, which may not always match real-world scenarios.

27. The method used when there are inequalities (>=) in constraints is:

A. Dual Simplex Method

B. Simplex Method
C. Hungarian Method

D. Graphical Method

Answer: A

Explanation: Dual simplex is preferred when constraints are '>=' type and primal is not feasible.

28. The total number of basic variables in a solution is equal to:

A. Number of variables

B. Number of constraints

C. Number of non-basic variables

D. Rows + Columns

Answer: B

Explanation: In an LPP, the number of basic variables equals the number of constraints (m).

29. Slack variables are added to:

A. Maximization problems only

B. Convert >= constraints

C. Convert <= constraints into equations

D. Make equations non-linear

Answer: C

Explanation: Slack variables are added to <= constraints to convert them into equalities in the Simplex

method.

30. Surplus variables are used when constraints are of type:

A. <=

B. =

C. >=

D. None of these

Answer: C

Explanation: Surplus variables are subtracted in >= constraints to convert them into equalities.