Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Stochastic multi-stage linear programs are rarely used in practical applications due to their size and complexity. Using a general matrix to aggregate the constraints of the deterministic equivalent yields a lower bound. A similar aggregation in the dual space provides an upper bound on the optimal value of the given stochastic program. Jensen's inequality and other approximations based on aggregation are a special case of the suggested approach. The lower and upper bounds are tightened by updating the aggregating weights.
Robert Manson Sawko, Malgorzata Zimon
SIAM/ASA JUQ
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003