Scribd
Upload
5 views3 pages

Unit1 Linear Programming Notes and MCQs

The document provides an overview of Linear Programming (LP) concepts, including methods for optimization, constraints, and key terms. It covers techniques such as the Graphical Method, Simplex Method, Dual Simplex Method, Transportation Problem, and Assignment Problem, along with important definitions and MCQs with answers. The content is focused on foundational knowledge and problem-solving strategies in LP.

Uploaded by

prathamsingh5251
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
5 views3 pages

Unit1 Linear Programming Notes and MCQs

The document provides an overview of Linear Programming (LP) concepts, including methods for optimization, constraints, and key terms. It covers techniques such as the Graphical Method, Simplex Method, Dual Simplex Method, Transportation Problem, and Assignment Problem, along with important definitions and MCQs with answers. The content is focused on foundational knowledge and problem-solving strategies in LP.

Uploaded by

prathamsingh5251
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/ 3

UNIT-I: Linear Programming

Theory Notes (MCQ-Focused)

1. Linear Programming Basics:

- LP is a method to optimize (maximize or minimize) a linear objective function.

- Constraints are linear inequalities. Variables are non-negative.

- Inventor: George Dantzig

2. Graphical Method:

- Used only for two-variable problems.

- Feasible region formed by constraints. Solution lies at corner points.

3. Simplex Method:

- For problems with more than 2 variables.

- Uses slack/surplus/artificial variables. Iterate until optimality is reached.

- Entering variable: Most negative Zj - Cj. Stop when all Zj - Cj >= 0.

4. Dual Simplex Method:

- Used when initial solution is optimal but not feasible.

- Pivot row: Most negative RHS value.

5. Transportation Problem (TP):

- Minimize cost of transporting goods. Supply must equal demand.

- Methods: NWCR, Least Cost, VAM (best). Optimality: MODI method.

6. Assignment Problem (AP):

- One-to-one task assignment. Solved using Hungarian method.

- Steps: Row/column reduction -> cover zeros -> adjust matrix.

7. Important Terms:

- Feasible Solution: Satisfies constraints.

- Optimal Solution: Best value of Z.

- Unbounded: Z goes to infinity. Infeasible: No common feasible region.


20 Important MCQs with Answers

1. Who is considered the father of Linear Programming?

Answer: C. George Dantzig

2. The feasible region in a Linear Programming problem is always:

Answer: B. Polygonal

3. In LP, the condition x >= 0 is known as:

Answer: D. Non-negativity constraint

4. The graphical method is used only for:

Answer: C. 2-variable LP

5. Slack variables are added to:

Answer: B. '<=' type constraints

6. In the simplex method, the entering variable is selected based on:

Answer: A. Highest negative Zj - Cj

7. What does an unbounded solution mean in LP?

Answer: C. Objective function increases infinitely

8. Which of the following methods is used to find an initial feasible solution in transportation problem?

Answer: C. VAM

9. A transportation problem is said to be balanced if:

Answer: B. Supply = Demand

10. The assignment problem is a special case of:

Answer: A. Transportation Problem

11. The Hungarian method is used to solve:

Answer: B. Assignment problems

12. In a maximization LP problem, we stop simplex iterations when:

Answer: A. All Zj - Cj >= 0

13. Surplus variables are added in:

Answer: C. '>=' constraints

14. Artificial variables are used in:

Answer: C. When constraints are '=' or '>='

15. Which method is best for large LP problems (more than 2 variables)?

Answer: B. Simplex method

16. The optimal solution to an LPP always occurs at:

Answer: C. A vertex (corner point)


17. MODI method is used for:

Answer: C. Optimality in transportation

18. What is the main purpose of using dummy rows/columns in TP?

Answer: C. Balance the problem

19. The number of allocations in basic feasible solution of TP must be:

Answer: C. m + n - 1

20. Which variable ensures feasibility in artificial variable method?

Answer: C. Artificial

You might also like