Matrix-Chain-Multiplication. Dynamic programming algorithm: matrix chain multiplication, where the goal is to find the most computationally efficient matrix order when multiplying an arbitrary number of matrices in a row.