Operations Research: Linear Programming and Its Algorithms
Commerce2 min readNov 21, 2026

Operations Research: Linear Programming and Its Algorithms

Operations Research: Linear Programming and Its Algorithms
2 min read · 296 words

Quick Answer

Operations research tools optimise decisions: linear programming maximises or minimises a linear objective under linear constraints; the transportation method distributes at least cost; assignment problems match tasks one-to-one; queuing theory and simulation handle randomness.

Visual Summary

  • Linear programming — optimise a linear objective under constraints.
  • Corner points — the optimum hides at a feasible vertex.
  • Transportation — least-cost distribution from sources to sinks.
  • Assignment — one-to-one matching minimising total cost.

Linear Programming

Formulate: decision variables, a linear objective (maximise profit or minimise cost), and linear constraints (resources, demand). The feasible region is a polygon; the optimum lies at a CORNER POINT of that region — found by the graphical method (two variables) or the simplex algorithm (many). Slack variables absorb unused capacity; shadow prices value each extra unit of a scarce resource.

Transportation, Assignment and Queues

The transportation problem ships from sources to sinks at least cost — solved by the north-west corner initial solution plus stepping-stone or MODI improvement. The assignment problem matches n tasks to n agents one-to-one — the Hungarian method finds the minimum-cost matching. Queuing theory analyses waiting lines (arrival rate, service rate, number of servers); simulation models random systems when formulas run out.

Exam Angle

NET passages stage a resource-allocation scenario and ask the tool or the corner-point logic. Practise in the UGC NET Commerce mock.

FAQ

Where does the LP optimum live?
At a corner (vertex) of the feasible region — never in its interior.

What is a shadow price?
The value of one extra unit of a scarce resource, read from the dual.

Related reading

Exam angle

How exams use this: CA/Foundation papers mix recall, calculation and application in one sitting — train all three under +1/−0.25. Test it under exam conditions →

Quick revision

  • Linear programming: — optimise a linear objective under constraints.
  • Corner points: — the optimum hides at a feasible vertex.
  • Transportation: — least-cost distribution from sources to sinks.
  • Assignment: — one-to-one matching minimising total cost.
  • Econometric Inference: Standard Errors and Assumption Breaches
  • Research Measurement: Scales, Reliability and Validity
ShareTelegramX

Have a doubt on this topic?