期刊文献+

APPROXIMATE LAGRANGE MULTIPLIER ALGORITHM FOR STOCHASTIC PROGRAMS WITH COMPLETE RECOURSE:NONLINEAR DETERMINISTIC CONSTRAINTS

APPROXIMATE LAGRANGE MULTIPLIER ALGORITHM FOR STOCHASTIC PROGRAMS WITH COMPLETE RECOURSE:NONLINEAR DETERMINISTIC CONSTRAINTS
原文传递
导出
摘要 In this paper we design an approximation method for solving stochastic programs with com-plete recourse and nonlinear deterministic constraints. This method is obtained by combiningapproximation method and Lagrange multiplier algorithm of Bertsekas type. Thus this methodhas the advantages of both the two. In this paper we design an approximation method for solving stochastic programs with com-plete recourse and nonlinear deterministic constraints. This method is obtained by combiningapproximation method and Lagrange multiplier algorithm of Bertsekas type. Thus this methodhas the advantages of both the two.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1992年第3期207-213,共7页 应用数学学报(英文版)
基金 This project is supported by the National Natural Science Foundation of China
  • 相关文献

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部