Every OR journey begins with modeling.

At this stage, you learn to:

• Define decision variables

• Construct linear objective functions

• Translate constraints into algebraic form

• Interpret feasible regions geometrically

• Solve small models graphically

This is where mathematical abstraction meets decision-making.

Core References

• Introduction to Operations Research — Hillier & Lieberman (10th ed.)

• Operations Research: An Introduction — Hamdy Taha (10th ed.)

Understanding modeling is not enough.

You must understand how optimization works internally.

Topics include:

• Standard form transformation

• Slack and artificial variables

• Two-phase and Big-M methods

• Pivot operations

• Degeneracy and multiple optima

Even if modern solvers abstract this away, understanding Simplex builds structural intuition.

Core References

• Hillier & Lieberman — Simplex chapter

• Taha — Simplex & Sensitivity sections

• Winston — Operations Research: Applications and Algorithms

Duality elevates linear programming from computation to insight.

Key ideas:

• Constructing the dual problem

• Strong duality theorem

• Complementary slackness

• Shadow prices

• Post-optimal analysis

This stage connects mathematics with economic interpretation and strategic decision-making.

Core References

• Hillier & Lieberman — Duality & Sensitivity

• Taha — Duality and Post-Optimal Analysis

• Bazaraa, Jarvis & Sherali — Linear Programming and Network Flows

Real-world decisions are rarely continuous.

You now learn to model:

• Binary (0–1) decisions

• Logical constraints

• Fixed-charge problems

• Combinatorial structures

And solve them using:

• Branch-and-bound

• Cutting planes

• Hybrid approaches

Applications include facility location, routing, scheduling, and project selection.

Core References

• Hillier & Lieberman — Integer Programming

• Taha — Integer Linear Programming

• Nemhauser & Wolsey — Integer and Combinatorial Optimization

Some optimization problems admit specialized algorithms.

Topics include:

• Shortest path

• Minimum spanning tree

• Maximum flow

• Minimum-cost flow

• Transportation and assignment models

These problems are foundational in logistics, telecommunications, and infrastructure systems.

Core References

• Hillier & Lieberman — Network Models

• Ahuja, Magnanti & Orlin — Network Flows

• Winston — Network chapters

Large-scale optimization requires exploiting structure.

You’ll encounter:

• Dantzig–Wolfe decomposition

• Column generation

• Benders decomposition

• Lagrangian relaxation

These methods underpin many industrial-scale optimization engines.

Core References

• Bazaraa, Jarvis & Sherali — Decomposition principle

• Conejo et al. — Decomposition Techniques in Mathematical Programming

Many relevant optimization problems are NP-hard.

Exact optimality becomes computationally impractical.

This stage introduces structured search frameworks such as:

• GRASP

• Simulated Annealing

• Tabu Search

• Genetic Algorithms

These approaches dominate large-scale routing, scheduling, and layout problems in practice.

Core References

• Hillier & Lieberman — Metaheuristics overview

• Gendreau & Potvin — Handbook of Metaheuristics

• Resende & Ribeiro — Optimization by GRASP

At an advanced level, one must understand when efficiency is impossible.

Topics include:

• P vs NP

• NP-completeness

• Polynomial reductions

• Approximation algorithms

This stage builds judgment — knowing when to reformulate, approximate, decompose, or accept heuristic solutions.

Core References

• Kleinberg & Tardos — Algorithm Design

• Garey & Johnson — Computers and Intractability

• Papadimitriou & Steiglitz — Combinatorial Optimization

This roadmap follows a disciplined progression:

Linear Programming → Simplex → Duality → Integer Models → Networks → Decomposition → Metaheuristics → Complexity

It is not meant to be rushed.

Operations Research rewards depth, structure, and conceptual clarity.

Over time, this structured understanding becomes what differentiates someone who can “use a solver” from someone who can design optimization systems.

Below is a consolidated list of the primary books that support this Study Path.

These references are widely used in leading university programs and form the backbone of modern Operations Research education.