Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 26, No. 4, November 2001, pp. 769-795
DOI: 10.1287/moor.26.4.769.10009
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Kryazhimskii, A. V.
Right arrow Articles by Ruszczynski, A.
Right arrow Search for Related Content

Constraint Aggregation in Infinite-Dimensional Spaces and Applications

Arkadii V. Kryazhimskii, Andrzej Ruszczynski

Mathematical Steklov Institute, Russian Academy of Sciences, Gubkina 8, GSP-1, 117966 Moscow, Russia
RUTCOR and Department of Management Science and Information Systems, Rutgers University, Piscataway, New Jersey 08854

rusz{at}rutcor.rutgers.edu

An aggregation technique for constraints with values in Hilbert spaces is suggested. The technique allows us to replace the original optimization problem by a sequence of subproblems having scalar or finite-dimensional constraints. Applications to optimal control, games, and stochastic programming are discussed in detail.

Key Words: Constrained optimization in vector spaces; aggregation; optimal control; games; stochastic programming
History: Received: October 2, 1999; revision received: June 9, 2000;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by INFORMS.