Many sequential decision problems can be formulated as Markov decision processes (MDPs) where the optimal value function (or cost-to-go function) can be shown to satisfy a monotone structure in some ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Shipra Agrawal, Zizhuo Wang, Yinyu Ye, A Dynamic Near-Optimal Algorithm for Online Linear Programming, Operations Research, Vol. 62, No. 4 (July-August 2014), pp. 876-890 ...

You use these functions when you want to find values based on the value in a corresponding cell. Thanks to the newish dynamic array function XLOOKUP (), you now have more power and less confusion.