STOCHASTIC CONVEX PROGRAMMING: SINGULAR MULTIPLIERS AND EXTENDED DUALITY SINGULAR MULTIPLIERS AND DUALITY
STOCHASTIC CONVEX PROGRAMMING: SINGULAR MULTIPLIERS AND EXTENDED DUALITY SINGULAR MULTIPLIERS AND DUALITY
复制标题
随机凸规划:奇异乘数和扩展对偶性 奇异乘数和对偶性
DOI:
--
复制
发表时间:
1976
期刊:
影响因子:
--
通讯作者:
R. Wets
中科院分区:
文献类型:
--
作者:
R. Rockafellar;R. Wets
A two-stage stochastic programming problem with recourse is studied here in terms of an extended Lagrangian function which allows certain multipliers to be elements of a dual space (i?00)*, rather than an ϊ£λ space. Such multipliers can be decomposed into an i^-component and a "singular" component. The generalization makes it possible to characterize solutions to the problem in terms of a saddle-point, if the problem is strictly feasible. The Kuhn-Tucker conditions for the basic duality framework are modified to admit singular multipliers. It is shown that the optimal multiplier vectors in the extended dual problem are, in at least one broad case, ideal limits of maximizing sequences of multiplier vectors in the basic dual problem.