Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
This paper investigates the problem of unconstrained optimization when there is only partial information on the random parameters in the objective function. The relation between the optimization performance and the available information is established. The best information structure design with fixed rank is described. The designing procedure is set up in such a way that successive information augmentation or deletion can be considered. The procedure can also be extended to multiperson decision problems. © 1978 Plenum Publishing Corporation.
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Nimrod Megiddo
Journal of Symbolic Computation
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics