Operations Research
100 questions across 8 topics. Also examined in CNET, ISS.
Linear Programming Problem, Simplex Method, Duality
- 176Forming the dual of a linear programmeMSET June 2025Linear Programming Problem, Simplex Method, DualityHard
- 177Solving a small LPP by substitutionMSET June 2025Linear Programming Problem, Simplex Method, DualityHard
- 178An LPP with unrestricted variablesMSET June 2025Linear Programming Problem, Simplex Method, DualityHard
- 166Optimum (Neyman–cost) allocation in stratified samplingMSET April 2024Linear Programming Problem, Simplex Method, DualityHard
- 176Simplex sensitivity — re-checking optimality after a cost changeMSET April 2024Linear Programming Problem, Simplex Method, DualityHard
- 177Graphical LPP — identifying a redundant constraintMSET April 2024Linear Programming Problem, Simplex Method, DualityMedium
- 176Matching a primal and its stated dual — an unresolvable coefficient clashMSET March 2023Linear Programming Problem, Simplex Method, DualityHard
- 177Unique primal optimum implies a unique dual optimum tooMSET March 2023Linear Programming Problem, Simplex Method, DualityHard
- 178Total unimodularity gives the assignment problem its binary solutionsMSET March 2023Linear Programming Problem, Simplex Method, DualityEasy
- 10Convexity facts in linear programmingMSET September 2021Linear Programming Problem, Simplex Method, DualityMedium
- 38Contradictory constraints make an LP infeasibleMSET September 2021Linear Programming Problem, Simplex Method, DualityEasy
- 39Constructing the dual of a three-constraint LPPMSET September 2021Linear Programming Problem, Simplex Method, DualityMedium
- 95Two-phase simplex — a lingering zero-valued artificial signals degeneracyMSET September 2021Linear Programming Problem, Simplex Method, DualityHard
- 188A false claim about dynamic programming's scopeMSET September 2021Linear Programming Problem, Simplex Method, DualityMedium
- 189Constructing the dual of an LPP and checking each constraint's directionMSET September 2021Linear Programming Problem, Simplex Method, DualityMedium
- 9Spotting alternate optima when the objective is parallel to a binding constraintMSET December 2020Linear Programming Problem, Simplex Method, DualityMedium
- 10Existence of a basic feasible solution is guaranteed; uniqueness of representation is notMSET December 2020Linear Programming Problem, Simplex Method, DualityMedium
- 11The min-of-maxes formula for the median of three numbersMSET December 2020Linear Programming Problem, Simplex Method, DualityEasy
- 37Feasible yet unbounded: a genuinely combined-letter key answerMSET December 2020Linear Programming Problem, Simplex Method, DualityMedium
- 38The dual of the dual is the primal; not every feasible point is basicMSET December 2020Linear Programming Problem, Simplex Method, DualityEasy
- 39Constructing the dual and matching coefficients term by termMSET December 2020Linear Programming Problem, Simplex Method, DualityMedium
- 40An optimum can exist on an unbounded feasible regionMSET December 2020Linear Programming Problem, Simplex Method, DualityHard
- 95Building the Lagrangian with squared slack variables for inequality constraintsMSET December 2020Linear Programming Problem, Simplex Method, DualityHard
- 167Neyman allocation minimizes sample size for a fixed target varianceMSET December 2020Linear Programming Problem, Simplex Method, DualityHard
- 189Karmarkar's canonical form requires homogeneous, not non-homogeneous, constraintsMSET December 2020Linear Programming Problem, Simplex Method, DualityMedium
- 9Locating the optimum along a shared-value edge of the feasible polygonMSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 10The fundamental theorem of linear programmingMSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 37An equality constraint pins x1, forcing two remaining constraints into direct contradictionMSET June 2019Linear Programming Problem, Simplex Method, DualityEasy
- 38Both halves of the standard LP duality correspondence holdMSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 39Constructing the dual and matching every coefficientMSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 40Weak duality: an unbounded dual forces primal infeasibilityMSET June 2019Linear Programming Problem, Simplex Method, DualityEasy
- 187Two stages split c evenly: f2(5)=25/4 (the key's 125/27 is f3(5))MSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 189Dual prices are CB'B^-1, and the dual simplex need not end degenerateMSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 190The DP stage for x2 carries both constraints that involve x2MSET June 2019Linear Programming Problem, Simplex Method, DualityMedium
- 14Increasing x2 keeps every constraint satisfied and Z grows without boundMSET January 2018 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 15A solid ellipse is a convex setMSET January 2018 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 16The fundamental theorem of LP: an optimum is attained at an extreme pointMSET January 2018 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 78Strong duality: the primal has an optimum iff the dual doesMSET January 2018 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 76Sensitivity analysis gives ranges, and a new constraint can only hurtMSET January 2018 Paper IIILinear Programming Problem, Simplex Method, DualityMedium
- 77The optimum is at the intersection of the two constraint linesMSET January 2018 Paper IIILinear Programming Problem, Simplex Method, DualityEasy
- 78Cutting planes add constraints; B&B lower bounds never decreaseMSET January 2018 Paper IIILinear Programming Problem, Simplex Method, DualityMedium
- 79Wolfe's method: stationarity of the Lagrangian in x1 and x2MSET January 2018 Paper IIILinear Programming Problem, Simplex Method, DualityHard
- 140Sensitivity analysis: which changes leave the current basis optimalMSET January 2018 Paper IIILinear Programming Problem, Simplex Method, DualityMedium
- 14Setting n-m variables to zero gives a basic solutionMSET April 2017 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 15A closed disc is convexMSET April 2017 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 16x1+x2le1 and x1+x2ge2 cannot both holdMSET April 2017 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 78Weak duality: an unbounded dual leaves no feasible primalMSET April 2017 Paper IILinear Programming Problem, Simplex Method, DualityEasy
- 77The shadow price is the rate of change of the optimal objective valueMSET April 2017 Paper IIILinear Programming Problem, Simplex Method, DualityEasy
- 78Only (A) and (D) are feasible, and (A) gives the larger Z=100MSET April 2017 Paper IIILinear Programming Problem, Simplex Method, DualityHard
- 79The revised simplex carries B^-1 and the multipliers cBB^-1 every iterationMSET April 2017 Paper IIILinear Programming Problem, Simplex Method, DualityMedium
Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)
- 179M/M/1 waiting probabilitiesMSET June 2025Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Hard
- 180Stationary distribution of M/M/1MSET June 2025Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Hard
- 180M/M/1 queue — computing the standard performance measuresMSET April 2024Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Hard
- 179M/M/1 — spotting the false relation among the standard formulasMSET March 2023Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
- 180Traffic density for an M/M/3 systemMSET March 2023Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
- 125M/M/1 — probability the server is idleMSET September 2021Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Medium
- 185M/G/1 — waiting time grows with service-time varianceMSET September 2021Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
- 186A two-node Jackson network — solving the traffic equationsMSET September 2021Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Hard
- 125Doubling both arrival and service rates in M/M/1 halves the average waitMSET December 2020Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Medium
- 171No listed option correctly caps the M/M/K departure rate at kmuMSET December 2020Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Hard
- 125Squaring the traffic intensity lowers it, so the second queue is shorterMSET June 2019Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Medium
- 186The M/M/K departure rate caps at kmu — no printed option says soMSET June 2019Steady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
- 75M/M/1: Ls=rho/(1-rho)MSET April 2017 Paper IISteady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
- 142rho=0.6: P(2 in the system)=0.4times0.36=0.144MSET April 2017 Paper IIISteady-State Solutions of Markovian Queuing Models (M/M/1, M/M/C, M/G/1)Easy
Elementary Queuing and Inventory Models
- 179Inventory costs — which component moves with order quantityMSET April 2024Elementary Queuing and Inventory ModelsMedium
- 184Optimal inventory level for exponential demandMSET September 2021Elementary Queuing and Inventory ModelsHard
- 124Re-order level sits above minimum (safety) stock by constructionMSET December 2020Elementary Queuing and Inventory ModelsEasy
- 184Direct substitution into the inventory-position formulaMSET December 2020Elementary Queuing and Inventory ModelsEasy
- 185Reserving servers for a customer category is control of the queue disciplineMSET December 2020Elementary Queuing and Inventory ModelsMedium
- 186Both standard interpretations of the Lindley recursion's variables are validMSET December 2020Elementary Queuing and Inventory ModelsMedium
- 124The EOQ is where ordering and carrying costs balanceMSET June 2019Elementary Queuing and Inventory ModelsEasy
- 184Reorder level = usage during the lead timeMSET June 2019Elementary Queuing and Inventory ModelsEasy
- 185Stock S=Q-ut hits zero at t=Q/uMSET June 2019Elementary Queuing and Inventory ModelsEasy
- 75At the EOQ the ordering and holding costs are equalMSET January 2018 Paper IIElementary Queuing and Inventory ModelsEasy
- 77Little's law gives Ls=Lq+lambda/mu, not Lq+1/lambdaMSET January 2018 Paper IIElementary Queuing and Inventory ModelsEasy
- 90Little's law in the queue: Wq=Lq/lambdaMSET January 2018 Paper IIIElementary Queuing and Inventory ModelsEasy
- 77Annual demand 3200, holding frac14times6: Q^=sqrt2cdot3200cdot150/1.5=800MSET April 2017 Paper IIElementary Queuing and Inventory ModelsEasy
- 141Holding cost is proportional to unit cost, so Q^propto C^-1/2MSET April 2017 Paper IIIElementary Queuing and Inventory ModelsEasy
Transportation and Assignment Problems
- 178Assignment problem — solving a 4times4 cost matrixMSET April 2024Transportation and Assignment ProblemsHard
- 36Assignment problem — minimising total programmer timeMSET September 2021Transportation and Assignment ProblemsMedium
- 40The standard basic-variable count for a transportation tableMSET September 2021Transportation and Assignment ProblemsEasy
- 36A degenerate North-West corner allocation, verified by direct cost computationMSET December 2020Transportation and Assignment ProblemsHard
- 36Comparing the four proposed assignments directly by total costMSET June 2019Transportation and Assignment ProblemsEasy
- 95Balanced supply and demand is both necessary and sufficient for transportation feasibilityMSET June 2019Transportation and Assignment ProblemsMedium
- 80A transportation BFS has m+n-1 basic variablesMSET January 2018 Paper IITransportation and Assignment ProblemsEasy
- 79A transportation BFS has at most m+n-1 basic variablesMSET April 2017 Paper IITransportation and Assignment ProblemsEasy
Dynamic and Integer Programming
- 187Equal allocation minimises a separable sum of squaresMSET September 2021Dynamic and Integer ProgrammingMedium
- 187Bellman's principle guarantees optimal subpaths, but not their uniquenessMSET December 2020Dynamic and Integer ProgrammingMedium
- 188AM–GM gives the minimum of y1^2+y2^2 under a fixed productMSET December 2020Dynamic and Integer ProgrammingEasy
- 188Equal parts maximise a product with a fixed sumMSET June 2019Dynamic and Integer ProgrammingEasy
- 76A node is fathomed when it is infeasible or integer — not when it is fractionalMSET April 2017 Paper IIIDynamic and Integer ProgrammingEasy
Sequencing and Project Scheduling
- 190CPM versus PERT — the deterministic/probabilistic distinctionMSET September 2021Sequencing and Project SchedulingEasy
- 123Sequencing a two-machine flow shop by Johnson's ruleMSET December 2020Sequencing and Project SchedulingHard
- 76Gantt charts schedule jobs on machines over timeMSET January 2018 Paper IISequencing and Project SchedulingEasy
- 76Johnson's rule: short A-times first, short B-times lastMSET April 2017 Paper IISequencing and Project SchedulingMedium