Matrix Chain Multiplication

This optimization problem asks the following: given a sequence of matrices, the goal is to find the most efficient way to multiply these matrices, minimizing the number of element-wise multiplications. There are many options because matrix multiplication is associative, and when multiplying matrices of different dimensions, the sizes of intermediary matrices as the computation is done greatly impacts the total number of operations.