This book uses consistent notation throughout. Below is a reference guide for the symbols and conventions used.
| Real numbers | |
| -dimensional real vectors | |
| , | Non-negative reals / non-negative real vectors |
| Integers | |
| , | Non-negative integers / non-negative integer vectors |
| Rational numbers | |
| Binary vectors of dimension | |
| Decision variable vectors (bold lowercase) | |
| Parameter vectors (bold lowercase) | |
| Zero vector | |
| Matrices (capital italic) | |
| -th component of vector | |
| Element in row , column of matrix | |
| Transpose of vector | |
| Transpose of matrix | |
| Dot product (inner product) of and | |
| Norm of vector | |
A standard linear program is written as:
| , | Maximize, minimize |
| s.t. | Subject to (constraints follow) |
| , , | Constraint types |
| Optimal solution | |
| Optimal objective value | |
| Sum of | |
| Sum over all indices in set | |
| Product | |
| For all in set | |
| There exists | |
| Function of | |
| Gradient of | |
| Hessian matrix of | |
| Value of that minimizes | |
| Convex hull of set | |
| Domain of function | |
| Polynomial time (P) | Polynomial-time solvable |
| NP-complete | NP-Complete problem |
| NP-hard | NP-Hard problem |
| LP | Linear Programming |
| IP | Integer Programming |
| ILP | Integer Linear Programming |
| BIP | Binary Integer Programming |
| MILP | Mixed-Integer Linear Programming |
| NLP | Nonlinear Programming |
| MINLP | Mixed-Integer Nonlinear Programming |