SD COLLEGE OF MANAGEMENT STUDIES

LINEAR PROGRAMMING
UNIT – 1

1. What is the primary objective of the simplex method in optimization?

a) Minimize the objective function
b) Maximize the objective function
c) Minimize the number of variables
d) Maximize the number of constraints
Ans-b

2. In the simplex method, what is a basic feasible solution?

a) A solution that satisfies all constraints
b) A solution that satisfies only some constraints
c) A solution that violates constraints
d) A solution that is infeasible
Ans-a

3. What is the significance of the pivot element in the simplex method?

a) It determines the next basic variable to enter the basis
b) It determines the objective function value
c) It determines the number of constraints
d) It determines the direction of movement in the solution space
Ans-a

4. When does the simplex method terminate?

a) When the objective function is maximized
b) When the objective function is minimized
c) When there are no negative coefficients in the objective function row
d) When all variables become basic variables
Ans-c

5. What is the role of the tableau in the simplex method?

a) It represents the constraints in standard form
b) It represents the initial feasible solution
c) It represents the pivot operations
 d) It represents the objective function coefficients
Ans-c

6. Which of the following is a requirement for applying the simplex method?

a) The objective function must be nonlinear
b) The constraints must be linear
c) The objective function must be quadratic
d) The constraints must be nonlinear
Ans-b

7. Which of the following is true about degeneracy in the simplex method?

a) It speeds up the convergence of the algorithm
b) It slows down the convergence of the algorithm
c) It doesn't affect the convergence of the algorithm
d) It invalidates the algorithm
Ans-b

8. What does the dual simplex method focus on?

a) Maximizing the objective function
b) Minimizing the objective function
c) Solving the dual problem of the original LP problem
d) Finding the primal feasible solution
Ans-c

9. Which of the following is a limitation of the simplex method?

a) It can only handle linear constraints
b) It always finds the optimal solution
c) It is efficient for all types of optimization problems
d) It works well for non-convex problems
Ans-a

10. In the simplex method, what does the term 'basis' refer to?
a) The set of non-basic variables
b) The set of basic variables
c) The set of all variables
d) The set of objective function coefficients
Ans-b
11. The objective function for a L.P model is 3x1 + 2x2 if x1 = 20 and x2 = 30, what
is the value of the objective function?
a) 0
b) 50
c) 60
d) 120
Ans-d

12. The true statement for the graph of inequations 3x+2y≤6 and 6x+4y≥20, is
a) Both graphs are disjoint
b) Both do not contain origin
c) Both contain point (1, 1)
d) None of these
Ans-a

13. Which of the following method is commonly used to solve assignment

problem?
a) stepping stone method
b) Hungarian method
c)North-west corner method
d) Vogal’s approximation method
Ans-b

14. Simplex problem is considered as infeasible when

a)All the variables in entering columns are negative
b)variables in the basis are negative
c)Artificial variables is present in basis
d) pivotal value is negative
Ans-c

15. Dual of the dual is the

a)primal
b) Dual
c)Either
d)None of these
Ans-a
 16. In a transportation problem with 4 supply points & 5 demands points, how
many number of constraints are required in its formulation?
a) 20
b)1
c)0
d)9
Ans-d

17. Vogal’s approximation method is connected with

a) Assignment problem
b) Inventory problem
c)Transportation problem
d) PERT
Ans-c

18. What is the objective of the assignment problem?

a) Minimizing the total cost of assigning tasks to agents
b) Maximizing the total profit of assigning tasks to agents
c) Balancing the workload among agents
d) Minimizing the number of tasks assigned to each agent
Ans-a

19. In the assignment problem, which of the following represents the constraints?
a) The costs associated with each task
b) The capacities of the agents
c) The assignment of tasks to agents
d) The objectives to be optimized
Ans-a

20. Which of the following techniques is commonly used to solve the assignment
problem?
a) Genetic algorithms
b) Simulated annealing
c) Linear programming
d) Dynamic programming
Ans-d
 21. What is the complexity of the Hungarian algorithm for solving the assignment
problem?
a) O(n log n)
b) O(n^2)
c) O(n^3)
d) O(2^n)
Ans-c

22. Which of the following scenarios is most suitable for the application of the assignment
problem?
a) Optimizing production in a factory
b) Finding the shortest path in a network
c) Scheduling tasks in a project
d) Allocating resources in a budget
Ans-a

23. What is the primary objective of the transportation problem?

a) Maximizing the number of transportation routes
b) Minimizing the total transportation cost
c) Balancing the workload among transportation vehicles
d) Maximizing the profit from transportation operations
Ans-b

24. In the transportation problem, which of the following represents the supply and
demand constraints respectively?
a) The costs associated with each transportation route
b) The capacities of the transportation vehicles
c) The amounts available at each supply node and required at each demand node
d) The objectives to be optimized
Ans-c

25. Which method is commonly used to solve the transportation problem?

a) Bellman-Ford algorithm
b) Dijkstra's algorithm
c) Vogel's approximation method
d) A* algorithm
Ans-c

26. What is the primary purpose of the dual simplex method in linear programming?
a) Maximizing the objective function
b) Minimizing the objective function
c) Finding the feasible region
d) Adjusting the solution to maintain feasibility and optimality
Ans-d

27. What is the dual simplex method primarily used for in linear programming?
a) Minimizing the number of variables
b) Maximizing the objective function
c) Finding alternative optimal solutions
d) Handling unbounded solutions
Ans-c

28. Constraints in an LP model represents

a)Limitations
b)Requirements
c)Balancing
d)All of above
Ans-d

29. Operation research approach is

a) Multi-disciplinary
b)Artificial
c)Intuitive
d)All of the above
Ans-a

30. Operation research analysis does noy

a) Predict future operation
b)Build more than one model
c)Collect the relevant data
d) Recommended decisions & accept
Ans-a