Maximising a Function Over a Finite Set of Actions---Technical Note

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.

MoreLess

Year of publication:	1996
Authors:	White, D. J.
Published in:	Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 42.1996, 4, p. 624-627
Publisher:	Institute for Operations Research and the Management Sciences - INFORMS
Subject:	finite \| fixed point \| partial solution \| algorithms

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Extent:	application/pdf
Type of publication:	Article
Other identifiers:	10.1287/mnsc.42.4.624 [DOI]
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10009198037