Maximising a Function Over a Finite Set of Actions—Technical Note
Management Science · 1996 · Volume 42 · Issue 4
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.
Keywords
finite, fixed point, partial solution, algorithms
Enable JavaScript for citation tools and additional paper interactions.