True or False Statements about LP Problems:

Here's the breakdown of the statements with justifications:

A. False: While the simplex method often starts at the origin (all basic variables at
zero), it can also begin at any corner point feasible (CPF) solution. The choice depends
on the specific problem and computational efficiency.
B. False: LP problems can handle variables that could be negative. Non-negativity
constraints need to be explicitly stated if variables can't be negative.
C. True: If there's no leaving variable (all ratios in the column are non-positive or zero),
the objective function can be increased indefinitely in a maximization problem, indicating
an unbounded solution.
D. True: Duality theory states that if a primal problem (minimization) has a feasible
solution, then the dual problem (maximization) also has a feasible solution, and both
have optimal solutions.
E. True: A non-basic variable with a coefficient of 0 in row 0 (objective function row)
after the simplex method indicates multiple optimal solutions. Changing the basic
variable associated with this non-basic variable won't affect the objective function value.
F. True: This is another implication of duality theory. If the primal minimization problem
has an unbounded cost (can be decreased indefinitely), the dual maximization problem
has an unbounded objective (can be increased indefinitely).
G. False: The "float" (slack) of an activity refers to the unused time or resources after
scheduling the activity. A positive float doesn't necessarily mean the activity is non-
critical. The critical path determines the minimum project completion time, and activities
with zero float are on the critical path.
H. True: When minimizing, you choose the column with the most negative reduced
cost as the entering variable to ensure the objective function decreases at each
iteration.
I. False: Degeneracy (a tie in the minimum ratio test) doesn't necessarily prevent
improvement. In some cases, even with degeneracy, the objective function value might
still improve at the next pivot.
J. False: A zero on the right-hand side of row i (RHS) simply means the current basic
variables satisfy constraint i exactly. You can still pivot in row i if the corresponding
column has a negative reduced cost (minimization) or a positive reduced cost
(maximization).
K. True: The first phase of the two-phase simplex method aims to find a feasible
solution for the primal problem with additional artificial variables. At the end, the
objective function (minimizing artificial variables) must be zero for a feasible primal
problem.
L. True: The "minimum ratio test" is used to determine the row to leave the basis in the
simplex method. It calculates the ratio of RHS to the corresponding basic variable
coefficient in each constraint and selects the row with the minimum positive ratio (or the
first negative ratio if all are negative).
M. False: The simplex multipliers at the end of the revised simplex method give the
shadow prices (dual variables) for the primal constraints, not the optimal solution to the
dual. However, you can use these shadow prices to find the optimal solution to the dual
with additional calculations.
N. True: The "reduced cost" in LP estimates the change in the objective value when a
unit change is made to the right-hand side of a constraint, assuming the basic variables
remain non-negative. It helps identify which constraint changes would most improve or
worsen the objective function.

Operations Research (OR) - True/False and Fill in the Blanks

1. Operations Research:
• Answer: C. Both a and b (Economical and Scientific). OR applies scientific methods
to solve economic and business problems, aiming for optimal solutions.
2. Models in OR:
• Answer: A. Mathematical models. OR primarily uses mathematical models to
represent situations and analyze them.
3. Impact of OR:
 • Answer: B. Decision making. OR leads to more informed decision-making by
considering various factors impacting operations.
4. Factors Evaluated by OR:
• Answer: C. Numeric and quantifiable factors. OR excels at analyzing factors that can
be measured and expressed numerically.
True or False:
5. Models and Increased Problems:
• Answer: False. Models in OR help identify and solve problems more efficiently, not
create more.
6. Origins of OR:
• Answer: True. OR did indeed originate during World War II in Britain for military
operations research.
7. OR and Applicability:
• Answer: False. OR techniques can be applied to various aspects, not just those with
mathematical models.
8. Human Element Limitation:
• Answer: True. A limitation of OR is sometimes neglecting the human element in
complex systems.
9. Phases of OR Methodology:
• Answer: C. Establishing controls. This is not a typical phase. OR focuses on problem
formulation, model building, solution analysis, and implementation.
10. Variables in Objective Function and Constraints:
• Answer: B. Controllable and uncontrollable. These variables represent factors that
can be influenced (controllable) or not (uncontrollable).
11. OR and War:
• Answer: D. Both A and B (Battlefield and Fighting). The goal of OR was to gain an
advantage without direct military engagement.
12. Team Approach in OR:
• Answer: D. All of the above (Scientists, Mathematicians, Academics). OR often
involves teams with diverse expertise.
Operations Research (OR) - More Questions
13. Hungarian Method:
• Answer: A. A transportation problem. The Hungarian method is an algorithm
specifically designed to solve transportation problems, minimizing the total cost
of transporting goods between supply and demand locations.
14. Solution Extraction from Models:
• Answer: B. Mathematical analysis. Primarily, mathematical analysis is used to
extract solutions from models in OR. While experiments might be helpful for
validation, solutions are often derived through mathematical techniques.
15. OR Models and Management Decisions:
• Answer: C. Both A and B (Policies and Actions). OR models help managers
make informed decisions regarding policies (overall strategies) and specific
actions to take within those policies.
16. Outcomes of OR Problems:
• Answer: B. Algorithms. By studying OR problems, researchers develop
algorithms, which are step-by-step procedures, to solve similar models efficiently.
17. Optimization Technique:
• Answer: D. Linear Programming. Linear programming is an OR technique
used to find the optimal solution (maximize profit, minimize cost) under
constraints (limitations) expressed as linear relationships.
18. Critical Path Identification:
• Answer: B. Program Evaluation and Review Technique (PERT). PERT is a
project management technique that helps identify the critical path, the sequence
of activities with zero slack time, determining the project's minimum completion
time.
19. Resource Allocation with OR:
• Answer: D. All of the above (Men, Machine, Money, Material, Time). OR
techniques help optimize the allocation of various limited resources, including
manpower, machines, budget, materials, and time, to achieve goals efficiently.
20. Minimizing Waiting and Service Costs:
 • Answer: A. Queuing Theory. Queuing theory analyzes waiting lines (queues) to
optimize service systems and minimize total costs associated with waiting time
and service delivery.
21. Objective Function in Linear Programming:
• Answer: C. A linear function in an optimization problem. The objective
function in linear programming is a linear mathematical expression representing
the quantity you want to optimize (maximize profit, minimize cost).
22. Standard Form in Linear Programming:
• Answer: B. Constraints are given by a set of linear equations. The standard
form in linear programming requires all constraints to be expressed as linear
equations (equalities) and all variables to be non-negative.
23. Feasible Solution:
• Answer: C. Both constraints and non-negative restrictions. A feasible
solution in linear programming satisfies all the problem's constraints and the non-
negativity restrictions (all variables are greater than or equal to zero).
24. Degenerate Solution:
• Answer: D. One or more basic variables are zero. In a degenerate solution,
during the simplex method iterations, one or more basic variables (variables
currently in the basis) have a value of zero. This can affect the speed of finding
the optimal solution but doesn't necessarily impact optimality itself.
25. Restriction on Number of Constraints in Graphical Method:
• Answer: C. 3. The graphical method for linear programming is typically limited to
two or three variables (dimensions) due to the difficulty of visualizing higher-
dimensional problems. There's no strict upper limit, but the complexity increases
significantly with more variables.
Operations Research (OR) - More Questions

26. Bounded Region in Graphical Representation:

• Answer: C. Feasible solution region. The bounded region in a graphical
representation of a linear programming problem represents the set of all feasible
 solutions (satisfying all constraints) that fall within the boundaries defined by the
constraints.
27. Graphical Optimal Value for Z:
• Answer: C. Corner points of the solution region. The optimal value for the
objective function (Z) in a graphical LPP can be obtained by evaluating it at the
corner points (vertices) of the feasible solution region. The highest value (for
maximization) or lowest value (for minimization) among these corner points is the
optimal solution.
28. Conditions for LPP:
• Answer: D. Both a and b (Constraints linear, Objective function linear).
Linear programming problems require both the objective function and all
constraints to be linear functions of the decision variables.
True or False:
29. Finite Value at Optimal Solution:
• True. The objective function in linear programming always has a finite value at
the optimal solution. By definition, the optimal solution maximizes (or minimizes)
the objective function within the feasible region, and feasible regions are
bounded (have a finite extent).
30. Non-Unique Optimal Solution:
• True. A finite optimal solution in linear programming can be non-unique. In some
cases, the objective function might have the same value at multiple corner points
of the feasible region. These are called alternate optimal solutions.
31. Feasible Region Classification:
• True. Feasible regions in linear programming can be classified into bounded
(finite extent), unbounded (extend infinitely in one or more directions), empty (no
points satisfy all constraints), or multiple (disjoint feasible regions exist).
32. Corner Points and Coordinate Axes:
• True. Corner points of a feasible region are always located at the intersections of
the region's boundaries with the coordinate axes. These points represent
solutions where one or more variables reach zero.
33. Identifying Feasible Region Type:
• Answer: B. A rectangle. The inequalities x - y <= 1 and x - y >= 2 define a
rectangle in the positive quadrant (both x and y are positive). The first inequality
creates a boundary where x - y = 1, and the second inequality creates a
boundary where x - y = 2. These boundaries intersect at points (3,1) and (1,3),
forming a rectangle.
34. Basic and Non-Basic Variables:
• Answer: C. Three variables are basic, one variable is non-basic. In the
equation 2x1 + 3x2 - 4x3 + 5x4 = 10, we can assume three variables (say x1, x2,
and x3) are basic variables with assigned values, and the remaining variable (x4)
is non-basic with a value of zero initially. This allows us to solve for the basic
variables using the equation.
35. Direction Vector and Optimal Solution:
• Answer: A. d(2,-5,3). The objective function for minimization (z = 2x1 - 5x2 +
3x3) has coefficients that define the direction vector. Because you want to
minimize, the direction vector points towards the region where the objective
function decreases. In this case, d(2,-5,3) points towards a decrease in z.
36. Initial Solution in Transportation Technique:
• Answer: A. The edge constraints for supply and demand are satisfied. The
only restriction for an initial solution in the transportation problem is that it
satisfies the supply and demand constraints for all origins (suppliers) and
destinations (demands). You can use various methods like the northwest-corner
method to find an initial feasible solution.
37. Stepping-Stone Method:
• Answer: B. Assist in moving from an initial feasible solution to the optimal
solution. The stepping-stone method is an iterative procedure used to improve
an initial feasible solution in the transportation problem. It helps identify the cell
with the most negative improvement potential and move units from that cell to
improve the overall objective function value, eventually leading to the optimal
solution.
38. Dummy Source or Destination:
• Answer: B. Obtain a balance between total supply and total demand. A
dummy source or destination is introduced in a transportation problem when the
total supply and demand are not balanced. The dummy source injects excess
supply into the system, and the dummy destination absorbs any excess demand.
This ensures a feasible solution exists by balancing the total units entering and
leaving the system.
Operations Research (OR) - More Questions on Transportation Problems

39. Unnecessary for Transportation Model:

• Answer: D. Degeneracy. Degeneracy (tie situations during calculations) can
occur in transportation problems, but it's not a requirement for using the model.
The model works with feasible solutions regardless of degeneracy.
40. Improving Initial Solution:
• Answer: D. Stepping-stone. The stepping-stone method is an iterative
approach to improve an initial feasible solution in a transportation problem,
leading to the optimal solution.
41. Transportation Method Assumptions:
• Answer: A. There are no economies of scale. The transportation model
assumes constant unit shipping costs regardless of the quantity shipped (no
economies or diseconomies of scale).
42. Balancing Supply and Demand:
• Answer: B. Units supplied; units demanded. In a transportation problem, the
total number of units supplied from all origins must equal the total number of
units demanded at all destinations to ensure a feasible solution.
43. Balancing Assignment/Transportation Problems:
• Answer: C. Dummy rows; dummy columns. Dummy sources or destinations
are introduced in transportation problems when supply and demand aren't
balanced. These act as balancing elements to create a feasible solution.
44. Unused Route Cost:
 • Answer: E. Improvement index. The improvement index (sometimes called
reduced cost) in a transportation problem represents the net cost difference
between using a non-basic route (not currently used in the solution) and its
current assigned cost in the table. It helps identify routes with the most significant
improvement potential.
45. Assignment Problem Solution Method:
• Answer: E. Hungarian method. The Hungarian method is an algorithm
specifically designed to solve assignment problems. It reduces the original cost
matrix to a form where an optimal solution can be found efficiently.
46. Opportunity Cost Based Initial Solution:
• Answer: B. Vogel's approximation method. Vogel's approximation method
identifies an initial solution for assignment problems based on opportunity costs,
aiming to get closer to the optimal solution faster than other methods like the
northwest corner rule.
47. Assignment Problem as Special Transportation Case:
• Answer: A. 1; 1. An assignment problem can be viewed as a transportation
problem where each source has a capacity of 1 (can only assign one item) and
each destination has a demand of 1 (needs one item).
48. Degeneracy Definition:
• Answer: A. Degeneracy. Degeneracy occurs in transportation problems when
the number of occupied cells (cells with positive values representing shipments)
is less than the total number of rows (origins) plus columns (destinations) minus
1. This can affect the number of iterations needed to reach the optimal solution.
49. Category of LP Problems:
• Answer: E. Network flow problems. Both transportation and assignment
problems fall under the category of network flow problems within linear
programming (LP). They deal with optimizing flows (shipments, assignments)
across a network considering costs and capacities.
50. Equation for Opportunity Costs:
 • Answer: B. The opportunity costs for using a particular route. The equation
Ri + Kj = Cij is used to calculate the opportunity cost in an assignment problem.
Ri represents the row penalty (reduced cost) for a particular row (worker), Kj
represents the column penalty (reduced cost) for a particular column (job), and
Cij is the actual cost of assigning worker i to job j.
51. Dummy Source/Destination Cost:
• Answer: D. Zero. In case of an unbalanced transportation problem, dummy
sources or destinations are introduced with a shipping cost coefficient of zero.
This ensures they don't affect the actual transportation costs while balancing the
supply and demand.
Operations Research (OR) - More Questions on Transportation Problems

52. Degeneracy and Transportation Problems:

• Answer: D. None of the above. Degeneracy in a transportation problem doesn't
necessarily mean total supply equals total demand, nor does it make the solution
infeasible or negative allocations. It simply indicates that during calculations, the
number of occupied cells (cells with positive values representing shipments) is
less than the total number of rows (origins) plus columns (destinations) minus 1.
53. Alternative Optimal Solution:
• Answer: B. Positive with at least one equal to zero. In a minimization
transportation problem, if there's at least one unused route with a zero
opportunity cost, there might be alternative optimal solutions. A zero opportunity
cost for an unused route suggests it could be included in the solution without
affecting the total cost.
54. Disadvantage of North-West Corner Rule:
• Answer: B. It does not take into account the cost of transportation. The
northwest corner rule is a simple method to find an initial solution, but it doesn't
consider transportation costs. This can lead to solutions that are not the most
optimal (minimum cost).
55. Feasible Solution in Transportation Problems:
 • Answer: C. m+n-1. A feasible solution in a transportation problem with 'm' rows
(supplies) and 'n' columns (destinations) requires the number of positive
allocations (cells with shipments) to be equal to m+n-1. This ensures all supply
and demand constraints are met.
56. Opportunity Cost for Optimality Test:
• Answer: C. Most positive number. When using opportunity costs to test for
optimality in an unused cell, you should consider the most positive value. A
positive opportunity cost indicates that using that route wouldn't improve the
solution (potentially increasing the total cost).
57. Degeneracy During Iterations:
• Answer: D. Either of the above (A or C). Degeneracy in transportation
problems can occur during iterations using the stepping-stone method when
either:
o A. The closed loop (circuit) used for improvement includes a diagonal
move (movement between adjacent cells).
o OR
o C. Two or more occupied cells on the closed loop have minus signs and
are tied for the lowest circled value (amount to be subtracted).
58. Large Negative Opportunity Cost:
• Answer: B. It represents per unit cost improvement. A large negative
opportunity cost in an unused cell suggests that including that route in the
solution would significantly reduce the total cost per unit shipped. It's a good
candidate for improvement during the stepping-stone method.
59. Smallest Quantity at Closed Path Corners:
• Answer: D. All of the above (A, B, C). The smallest quantity is chosen at the
corners of the closed loop with a negative sign for several reasons:
o A. It improves the total cost by introducing a route with a potentially lower
cost per unit.
o B. It doesn't disturb rim conditions (ensures supply and demand
constraints are still met).
 o C. It guarantees a feasible solution by ensuring no negative shipments
occur.
60. Balanced Transportation Problem:
• Answer: A. Balanced. A balanced transportation problem occurs when the total
supply from all origins is equal to the total demand at all destinations. This
ensures a feasible solution exists without introducing dummy sources or
destinations.
61. Optimality Verification Method:
• Answer: C. Modified distribution method (also called stepping-stone
method). The modified distribution method (stepping-stone method) is used to
verify the optimality of the current solution in a transportation problem. It
calculates opportunity costs for unused cells and checks if any negative costs
exist, indicating potential improvement.
62. Degeneracy Implications:
• Answer: D. a & b but not c. Degeneracy in a transportation problem can:
o A. Require dummy allocations (sources or destinations) to be added in
some cases to create a non-degenerate initial solution.
o B. Lead to more iterations in the stepping-stone method to reach the
optimal solution.
o It does not necessarily mean there's no feasible solution or multiple
optimal solutions exist.
63. Degeneracy Definition:
• Answer: E. Degenerate. A transportation problem solution is considered
degenerate when the number of occupied routes (cells with positive values
representing shipments) is less than the number of rows (origins) plus the
number of columns (destinations) minus 1.
64. Initial Solution Restriction:
• Answer: **C. We must have a number (equal to the number of rows plus the
number of columnsminus one
Responses to the remaining questions:
65. Restriction on Initial Solution:
• Answer: D. All of the above. While any method can be used to find an initial
solution for a transportation problem, it must satisfy all three conditions:
o It should be feasible, meaning it meets all supply and demand constraints
(rim conditions).
o It shouldn't be degenerate (enough occupied cells to meet m+n-1
requirement).
o There's no guarantee it's optimal (the lowest cost solution).
66. Purpose of Dummy Source/Destination:
• Answer: B. Prevent solution from becoming degenerate. Dummy sources or
destinations are introduced in transportation problems only when the total supply
and demand aren't balanced. They act as balancing elements to create a feasible
solution with a sufficient number of occupied cells and avoid degeneracy.
67. Degeneracy in Transportation Problems (Repeated)
• Answer: D. None of the above. This question is a repeat of question 52.
Degeneracy doesn't necessarily mean:
o Total supply equals total demand.
o The solution is infeasible.
o Allocations become negative.
o It simply indicates there are fewer occupied cells than m+n-1.
68. Alternative Optimal Solution (Repeated)
• Answer: B. Positive with at least one equal to zero. This question is a repeat
of question 53. In a minimization problem, if there's at least one unused route
with a zero opportunity cost, there might be alternative optimal solutions (routes
with zero cost improvement don't affect the minimum).
69. Disadvantage of North-West Corner Rule (Repeated)
• Answer: B. It does not take into account the cost of transportation. This
question is a repeat of question 54. The northwest corner rule is simple but
ignores transportation costs, potentially leading to suboptimal solutions.