Abstract
In this technical note we examine a method of extending a problem over a finite set of actions, to a problem of maximising a function over a bi-product set. The solution set is characterised in terms of fixed point solutions and partial solutions, and two improvement algorithms are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have