Optimal Algorithm: Look ahead in the reference string and replace the page that won't be needed for the longest time. Theoretically perfect — gives minimum page faults. Not implementable in practice (needs future knowledge).
Optimal Faults ≤ LRU Faults ≤ FIFO Faults