BCA 2nd year Optimization Technique MCQ with Answer
1. **What is the objective of linear programming? **
A) Maximize profit
B) Minimize cost
C) Both A and B
D) None of the above
**Answer:** C
2. **In a linear programming problem, the feasible region is defined by:**
A) Only the constraints
B) Only the objective function
C) Both constraints and the objective function
D) None of the above
**Answer:** A
3. **Which of the following is NOT a property of linear programming?**
A) Linearity
B) Divisibility
C) Non-negativity
D) Discreteness
**Answer:** D
4. **What does the term "slack variable" refer to in linear programming?**
A) A variable that does not appear in the objective function
B) A variable that allows for excess in constraints
C) A variable that increases the objective function
D) None of the above
**Answer:** B
5. **If a linear programming problem has no feasible solution, it is said to be:**
A) Bounded
B) Unbounded
C) Infeasible
D) Degenerate
**Answer:** C
6. **The graphical method can be used to solve LP problems with how many variables?**
A) 1
B) 2
C) 3
D) Any number of variables
**Answer:** B
7. **In a standard linear programming model, the objective function must be:**
A) Maximized only
B) Minimized only
C) Either maximized or minimized
D) None of the above
**Answer:** C
8. **In a simple LP problem, what does the term “corner point” refer to?**
A) Intersection of the constraints
B) Optimal solution
C) Point of infeasibility
D) None of the above
**Answer:** A
9. **Which of the following methods is used to solve linear programming problems?**
A) Simplex method
B) Branch and Bound
C) Both A and B
D) None of the above
**Answer:** C
10. **In a linear programming problem, if two or more basic feasible solutions yield the same
objective function value, the solution is termed as:**
A) Unique
B) Infeasible
C) Degenerate
D) Optimal
**Answer:** C
#### Assignment Problem
11. **The Hungarian method is used to solve:**
A) Transportation problems
B) Assignment problems
C) Inventory problems
D) Regression problems
**Answer:** B
12. **In an assignment problem, the objective is usually to:**
A) Maximize the total profit
B) Minimize the total cost
C) Maximize the total distance
D) Minimize the total number of assignments
**Answer:** B
13. **An assignment problem can be represented in the form of a:**
A) Matrix
B) Graph
C) Tree
D) All of the above
**Answer:** A
14. **In an assignment problem, each worker must be assigned to how many jobs?**
A) None
B) One
C) Two
D) As many as possible
**Answer:** B
15. **What is the maximum number of assignments in a 4x4 assignment problem?**
A) 4
B) 8
C) 16
D) 12
**Answer:** A
16. **If a solution to an assignment problem is not optimal, it may be improved by:**
A) Adding more jobs
B) Reducing costs
C) Changing the matrix dimensions
D) Performing iterations
**Answer:** D
17. **In the Hungarian method, the first step involves:**
A) Row reduction
B) Column reduction
C) Both A and B
D) None of the above
**Answer:** C
18. **The total number of assignments made in an assignment problem is equal to:**
A) The sum of all costs
B) The number of workers or jobs
C) The number of constraints
D) None of the above
**Answer:** B
19. **In the context of an assignment problem, "saturated" means:**
A) A job is assigned to more than one worker
B) A worker is assigned to only one job
C) All jobs are assigned
D) All workers are idle
**Answer:** C
20. **Unrestricted assignment problems often require:**
A) Linear programming
B) Integer programming
C) Dynamic programming
D) Stochastic programming
**Answer:** B
#### Transportation Problem
21. **The transportation problem is a special type of linear programming problem that involves:**
A) Transportation costs
B) Inventory management
C) Production scheduling
D) None of the above
**Answer:** A
22. **The objective of the transportation problem is to:**
A) Maximize transportation cost
B) Minimize transportation cost
C) Minimize the number of shipments
D) Maximize total shipment quantity
**Answer:** B
23. **In a transportation problem, a feasible solution must satisfy:**
A) Supply constraints only
B) Demand constraints only
C) Both supply and demand constraints
D) Neither supply nor demand constraints
**Answer:** C
24. **A shipping problem where there are fewer supply sources than demand points is referred to
as:**
A) Balanced
B) Unbalanced
C) Degenerate
D) Infeasible
**Answer:** B
25. **At which step of the transportation method is the optimality condition checked?**
A) Initial solution
B) Stepping stone method
C) Final iteration
D) None of the above
**Answer:** B
26. **In a transportation matrix, the sum of supply must be equal to the sum of demand for the
problem to be:**
A) Infeasible
B) Degenerate
C) Balanced
D) Unbalanced
**Answer:** C
27. **The "northwest corner rule" is a method for:**
A) Finding an initial feasible solution
B) Finding an optimal solution
C) Balancing supply and demand
D) None of the above
**Answer:** A
28. **In solving a transportation problem, the term "degeneracy" refers to:**
A) Multiple optimal solutions
B) Insufficient supply
C) When fewer than m+n-1 allocations are made
D) All supplies being exhausted
**Answer:** C
29. **In the transportation tableau, if a cell has no allocation, it is referred to as:**
A) Basic variable
B) Non-basic variable
C) Artificial variable
D) Decision variable
**Answer:** B
30. **Which method can improve the initial feasible solution in the transportation problem?**
A) Simplex method
B) Network optimization
C) Modified distribution method
D) All of the above
**Answer:** C
#### Mixed Questions
31. **What is the main goal of operations research?**
A) To find an optimal solution for decision problems
B) To minimize operational costs
C) To maximize employee satisfaction
D) To generate reports
**Answer:** A
32. **The simplex method is primarily used for solving:**
A) Non-linear problems
B) Integer programming problems
C) Linear programming problems
D) Transportation problems
**Answer:** C
33. **Duality in linear programming states that:**
A) Each linear programming problem has an equivalent dual problem
B) Only the primal problem has an optimal solution
C) Only the dual problem can be solved
D) There is no relationship between primal and dual
**Answer:** A
34. **In a maximization LP problem, if the dual is unbounded, the primal is:**
A) Bounded
B) Feasible
C) Infeasible
D) Both B and C
**Answer:** C
35. **The term "optimal solution" refers to:**
A) The best available solution given constraints
B) Any feasible solution
C) A trial solution that meets some constraints
D) None of the above
**Answer:** A
36. **Which of the following is NOT a method for solving LP problems?**
A) Simplex method
B) Transportation method
C) Branch and bound
D) Random search
**Answer:** D
37. **A practical application of linear programming is seen in:**
A) Resource allocation
B) Production scheduling
C) Transportation scheduling
D) All of the above
**Answer:** D
38. **A constraint in an LP problem is expressed as:**
A) An equation or an inequality
B) A variable value
C) An optimal solution
D) A cost value
**Answer:** A
39. **In sensitivity analysis, the focus is on:**
A) Understanding how changes in parameters affect the optimal solution
B) Finding multiple optimal solutions
C) Determining the infeasibility of a problem
D) Identifying redundant constraints
**Answer:** A
40. **An LP solution is termed unbounded when:**
A) There is no finite maximum or minimum
B) There are infinite feasible solutions
C) The feasible region is empty
D) Only one solution exists
**Answer:** A
41. **In a minimization problem with constraints, if all constraints are met but the solution is not
feasible, it is called:**
A) Optimal
B) Infeasible
C) Unbounded
D) Degenerate
**Answer:** B
42. **In the context of functional relationships, the objective function in LP can be expressed as:**
A) A linear combination of decision variables
B) An exponential function of variables
C) A quadratic function of variables
D) A polynomial function
**Answer:** A
43. **When formulating an LP problem, which of the following should be included?**
A) Objective function
B) Decision variables
C) Constraints
D) All of the above
**Answer:** D
44. **Which of these solutions is not part of the graphical method?**
A) Objective function lines
B) Feasibility space
C) Iterative adjustments
D) Corner points
**Answer:** C
45. **What does the term "optimum" refer to in operations research?**
A) The highest level of performance possible
B) The lowest cost achievable
C) The best outcome adhering to constraints
D) None of the above
**Answer:** C
46. **Which of the following methods could be used for solving a transportation problem?**
A) North-West Corner Method
B) Minimum Cost Method
C) Vogel's Approximation Method
D) All of the above
**Answer:** D
47. **To achieve a balanced transportation problem, what should be done when supply does not
equal demand?**
A) Increase supply
B) Increase demand
C) Add a dummy source or destination
D) None of the above
**Answer:** C
48. **The minimum cost method begins by allocating to the cell with:**
A) The highest cost
B) The lowest cost
C) The second lowest cost
D) Any cost
**Answer:** B
49. **Which of the following is a characteristic of linear programming?**
A) Nonlinear constraints
B) Affects real-world decision-making
C) Integer-only variables
D) None of the above
**Answer:** B
50. **Which of the following is a common assumption in linear programming?**
A) Certainty
B) Non-negativity
C) Linearity
D) All of the above
**Answer:** D
### More Mixed Questions
51. **In the transportation problem, if a cell has no allocation, it is referred to as a:**
A) Basic variable
B) Non-basic variable
C) Decision variable
D) Cost variable
**Answer:** B
52. **The graphical method for solving LP problems is best applied when:**
A) There are more than 3 variables
B) There are 2 variables
C) There is only one objective
D) None of the above
**Answer:** B
53. **What happens if all sources in a transportation model are saturated?**
A) A feasible solution is found
B) The problem becomes unbalanced
C) An optimal solution is reached
D) No allocation can be made
**Answer:** A
54. **In duality theory, if a primal is a maximization problem, the dual is a:**
A) Minimization problem
B) Non-linear problem
C) Integer programming problem
D) None of the above
**Answer:** A
55. **What is the term for a situation in linear programming where two or more basic feasible
solutions yield the same objective function value?**
A) Degeneracy
B) Optimality
C) Multiple optimal solutions
D) None of the above
**Answer:** A
56. **In the assignment problem, the solution is said to be "saturated" when:**
A) All workers are assigned
B) All jobs are completed
C) No further assignments are possible
D) None of the above
**Answer:** C
57. **A characteristic of the transportation model is:**
A) It assumes non-negativity
B) All variables can be negative
C) It does not consider costs
D) Each supply point can ship anything
**Answer:** A
58. **Can the optimal solution of a transportation problem be achieved at a corner point of the
feasible region?**
A) Yes
B) No
C) Only for unbounded problems
D) Only if constraints are linear
**Answer:** A
59. **In an assignment problem, the cost of assigning worker i to job j is represented by:**
A) Cij
B) Xij
C) Uij
D) Yij
**Answer:** A
60. **When you perform sensitivity analysis on a linear program, you are assessing the impact of
changes in:**
A) Decision variable values
B) Supply values
C) Constraint coefficients and right-hand sides
D) Objective function form
**Answer:** C
61. **The feasible region of a linear programming problem is:**
A) The area where the objective function is maximized
B) The area defined by the constraints of the problem
C) The set of all potential solutions
D) Both A and C
**Answer:** B
62. **If a transportation problem has dummy suppliers, it is typically the result of:**
A) Excess supply
B) Excess demand
C) An unbalanced problem
D) None of the above
**Answer:** C
63. **In an assignment problem, if any tasks are not assigned, this leads to:**
A) Under-utilization of resources
B) An unbalanced solution
C) An incomplete solution
D) All of the above
**Answer:** D
64. **A key limitation of linear programming is:**
A) It can handle complex relationships
B) It is limited to linear relationships only
C) It cannot include decision variables
D) It does not consider constraints
**Answer:** B
65. **Sensitivity analysis helps in determining:**
A) How the optimal solution changes with changes in input parameters
B) The cost implications of constraints
C) The nature of the feasible region
D) The methods used for optimization
**Answer:** A
66. **The optimal solution to a linear programming problem will always occur at:**
A) The intersection of the constraints
B) The point with maximum cost
C) The centroid of the feasible region
D) None of the above
**Answer:** A
67. **When applying the Simplex method, what is the first action?**
A) Select a basic feasible solution
B) Identify the entering and leaving variables
C) Establish the objective function
D) Expand the feasible region
**Answer:** A
68. **Which of the following steps is NOT part of the Hungarian method for solving assignment
problems?**
A) Row reduction
B) Column reduction
C) Modified distribution
D) Allocation of tasks
**Answer:** C
69. **The transportation model ensures that:**
A) Resources are neither over nor under-allocated
B) All resources must be depleted
C) Variables may take negative values
D) None of the above
**Answer:** A
70. **An indirect method for solving linear programming problems is:**
A) Iteration method
B) Graphical solution
C) Dual Simplex method
D) Heuristic method
**Answer:** D
#### Final Set of Questions
71. **The key to a feasible solution in linear programming is:**
A) The positioning of objective function lines
B) The intersection of constraints
C) Both A and B
D) None of the above
**Answer:** B
72. **Unbounded solutions occur when:**
A) There are infinite variables
B) The objective function is linear and grows indefinitely
C) Feasible solutions exhaust all limits
D) None of the above
**Answer:** B
73. **The input matrix of a transportation problem includes:**
A) Supply, demand, and cost
B) Only supply and demand
C) Only costs
D) Only decision variables
**Answer:** A
74. **The main advantage of linear programming is:**
A) Flexibility
B) Simplicity
C) Ability to model complex problems
D) All of the above
**Answer:** A
75. **The objective function of the assignment problem is represented as:**
A) Minimize the cost of assignments
B) Maximize the costs of assignments
C) Random assignment of tasks
D) None of the above
**Answer:** A
76. **In a balanced transportation problem, the total supply equals:**
A) Total cost
B) Total demand
C) Number of shipments
D) Number of weeks
**Answer:** B
77. **Which method can be used to verify the optimality of a transportation solution?**
A) Cell evaluation
B) The feasible solution check
C) Modified distribution
D) All of the above
**Answer:** D
78. **What type of variables are used in integer programming?**
A) Continuous
B) Integer-valued
C) Discrete
D) A and B
**Answer:** B
79. **When applying duality in linear programming, what do primal constraints correspond to?**
A) Dual variables
B) Dual objectives
C) Slack variables
D) None of the above
**Answer:** A
80. **To solve a transportation problem with fewer available supplies than demands, one would:**
A) Create extra supply points
B) Create extra demand points
C) Both A and B
D) Find a different model
**Answer:** A
81. **When implementing the Hungarian algorithm, reducing rows and columns helps to:**
A) Find the total minimum cost
B) Identify potential assignments
C) Balance supply and demand
D) Both A and B
**Answer:** D
82. **The requirement that solutions must be non-negative in linear programming is known as:**
A) Feasibility
B) Boundedness
C) Non-negativity constraint
D) Redundancy
**Answer:** C
83. **The objective value of a linear program can change due to:**
A) Changes in constraints
B) Changes in the objective function coefficients
C) Changes in right-hand-side values
D) All of the above
**Answer:** D
84. **If an allocation in the transportation problem is 'degenerate', it means:**
A) There are not enough destinations
B) There is at least one empty cell in the tableau
C) Total allocations are fewer than m+n-1
D) None of the above
**Answer:** C
85. **For an assignment problem, what does it mean if a job is assigned to more than one worker?**
A) Optimal assignment
B) Infeasibility
C) Improved solution
D) None of the above
**Answer:** B
86. **In linear programming, the term "constraint" refers to:**
A) The limits placed on decision variables
B) The objective function
C) The mathematical representation
D) None of the above
**Answer:** A
87. **What is the "shadow price" in linear programming?**
A) The increase in the objective function value per unit increase in a resource
B) The total cost of the solution
C) The coefficient of a decision variable
D) A measure of optimal solution
**Answer:** A
88. **A constraint that does not change the feasible region is called:**
A) Redundant
B) Binding
C) Non-binding
D) None of the above
**Answer:** A
89. **The optimal solution of a linear programming problem may be determined using:**
A) Sensitivity analysis alone
B) Just the graphical method
C) The simplex method or graphical method
D) Any method
**Answer:** C
90. **To enhance computational efficiency in dynamic LP problems, one approach is:**
A) Solve smaller problems iteratively
B) Use heuristic methods
C) Apply parallel processing
D) All of the above
**Answer:** D
91. **In operations research, heuristics refers to:**
A) Exact algorithms
B) Approximative methods that find good solutions in reasonable time
C) Problem formulations
D) Mathematical modeling
**Answer:** B
92. **Reducing the cost coefficients in an assignment problem matrix results in:**
A) Higher assignment costs
B) Unchanged optimal solutions
C) Potential changes to the optimal solution
D) None of the above
**Answer:** C
93. **The total number of constraints in a transportation model is:**
A) Equal to the number of supply sources
B) Equal to the number of demand points
C) Equal to both supply and demand points
D) Greater than supply or demand points
**Answer:** C
94. **Each allocation in a transportation problem contributes to:**
A) Increasing costs
B) Balancing supply and demand
C) Maximizing objective function
D) All of the above
**Answer:** B
95. **In an unbalanced assignment problem, dummy variables are used to:**
A) Maintain supply
B) Maintain demand
C) Ensure that all workers are assigned
D) None of the above
**Answer:** B
96. **To improve initial guesses in the Minimal Cost Method, it is best to examine:**
A) The total shipping method
B) The lowest costs available
C) The highest costs available
D) The alternate routes
**Answer:** B
97. **The total capacity of any mode of transportation refers to:**
A) Available shipments
B) Shipping limitations
C) Maximum volumes that can be shipped
D) Total costs
**Answer:** C
98. **The total allocation in a basic feasible solution is defined by:**
A) Capacity
B) Supply + Demand - Degrees of Freedom
C) Less than total supply and demand combined
D) None of the above
**Answer:** B
99. **How many basic feasible solutions can be found for a linear programming problem?**
A) Infinite
B) Limited by the number of constraints
C) Limited by the number of variables
D) A and B
**Answer:** D
100. **Which of the following is true regarding the assignment problem?**
A) The total number of assignments cannot exceed the number of workers
B) Any job can be assigned to any number of workers
C) It can be solved using linear programming directly
D) Jobs and workers do not exist simultaneously
**Answer:** A
