Scribd
Upload
9 views6 pages

Unit1 Linear Programming MCQs Set2

This document contains a set of multiple-choice questions (MCQs) related to Linear Programming, covering key concepts such as objective functions, feasible regions, decision variables, and methods for solving linear programming problems. It addresses various aspects including the conditions for feasibility, optimal solutions, and the role of duality. Each question is accompanied by the correct answer, providing a comprehensive review for students studying this topic.

Uploaded by

pd63155
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views6 pages

Unit1 Linear Programming MCQs Set2

This document contains a set of multiple-choice questions (MCQs) related to Linear Programming, covering key concepts such as objective functions, feasible regions, decision variables, and methods for solving linear programming problems. It addresses various aspects including the conditions for feasibility, optimal solutions, and the role of duality. Each question is accompanied by the correct answer, providing a comprehensive review for students studying this topic.

Uploaded by

pd63155
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Important MCQs - Unit I: Linear Programming (Set 2)

11. The objective function in a linear programming problem is a:

A. Linear function

B. Quadratic function

C. Exponential function

D. Constant function

Answer: A

12. The feasible region in a linear programming problem is always:

A. Circular

B. Elliptical

C. Convex

D. Concave

Answer: C

13. Which of the following is used to convert inequalities into equalities in LPP?

A. Slack variables

B. Objective function

C. Constraints

D. None of these

Answer: A

14. In LPP, the decision variables must be:

A. Integers

B. Real numbers

C. Non-negative

D. Negative
Answer: C

15. Which method is used to solve LPP with more than two variables?

A. Graphical

B. Enumeration

C. Simplex

D. Trial and error

Answer: C

16. The region that satisfies all the constraints in an LPP is known as:

A. Optimal region

B. Feasible region

C. Basic region

D. Constraint region

Answer: B

17. In a transportation problem, the objective is to:

A. Maximize cost

B. Minimize transportation cost

C. Increase supply

D. Maximize time

Answer: B

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

A. Constraints are inconsistent

B. Objective function is constant

C. Solution is unbounded

D. None of these
Answer: A

19. The condition in which the objective function increases indefinitely is known as:

A. Infeasibility

B. Optimality

C. Unboundedness

D. Slack

Answer: C

20. Which of the following methods is *not* used in solving LPP?

A. Graphical method

B. Simplex method

C. Matrix inversion method

D. Dual simplex method

Answer: C

21. In graphical method, if the feasible region is unbounded, then:

A. There is no solution

B. Optimal solution does not exist always

C. The solution is always at the origin

D. Problem is infeasible

Answer: B

22. A constraint in an LPP can be:

A. Only <= type

B. Only = type

C. <=, =, or >= type

D. Only >= type


Answer: C

23. In a standard LPP form, the inequalities are usually converted to:

A. Equalities using surplus variables

B. Equalities using slack or surplus variables

C. Equations using constants

D. Inequalities with only 'less than' form

Answer: B

24. Degeneracy in simplex method occurs when:

A. There is no feasible solution

B. Basic variables are more than constraints

C. A basic variable becomes zero

D. None of the above

Answer: C

25. Which of the following is true in the context of duality in LPP?

A. Every LPP has a dual

B. Only maximization problems have duals

C. Duality applies only in transportation problems

D. Dual always has fewer constraints

Answer: A

26. In the dual of a minimization problem:

A. Objective becomes maximization

B. Objective remains minimization

C. Constraints are not changed

D. Variables become integers


Answer: A

27. If the number of constraints is more than the number of variables, the solution is:

A. Always unique

B. Infeasible

C. May or may not be optimal

D. None of these

Answer: C

28. Which problem involves assigning jobs to workers in the most efficient way?

A. Transportation problem

B. Assignment problem

C. Queuing problem

D. Sequencing problem

Answer: B

29. An optimal solution in LPP always satisfies:

A. Some of the constraints

B. All the constraints

C. Only the objective function

D. None

Answer: B

30. The term 'redundant constraint' means:

A. Constraint that has no impact on feasible region

B. Constraint that maximizes the solution

C. Constraint that is not linear

D. None of the above


Answer: A

You might also like