Titlebook: Stochastic Programming 84, Part II; Andras Prékopa,Roger J.- B. Wets Book 1986Latest edition Springer-Verlag Berlin Heidelberg 1986 algori

只看該作者 · 發(fā)表于 2025-3-21 19:57:40

書目名稱Stochastic Programming 84, Part II影響因子(影響力)

書目名稱Stochastic Programming 84, Part II影響因子(影響力)學(xué)科排名

書目名稱Stochastic Programming 84, Part II網(wǎng)絡(luò)公開度

書目名稱Stochastic Programming 84, Part II網(wǎng)絡(luò)公開度學(xué)科排名

書目名稱Stochastic Programming 84, Part II被引頻次

書目名稱Stochastic Programming 84, Part II被引頻次學(xué)科排名

書目名稱Stochastic Programming 84, Part II年度引用

書目名稱Stochastic Programming 84, Part II年度引用學(xué)科排名

書目名稱Stochastic Programming 84, Part II讀者反饋

書目名稱Stochastic Programming 84, Part II讀者反饋學(xué)科排名

只看該作者 · 發(fā)表于 2025-3-21 20:24:04

A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic progralems correspond to maximizing the dual objective over the convex hull of finitely many dual feasible solutions. An optimizing sequence is produced for the primal problem that converges at a linear rate in the strongly quadratic case. An outer algorithm of augmented Lagrangian type can be used to introduce strongly quadratic terms, if desired.

只看該作者 · 發(fā)表于 2025-3-22 00:35:14

只看該作者 · 發(fā)表于 2025-3-22 05:58:26

只看該作者 · 發(fā)表于 2025-3-22 09:28:03

只看該作者 · 發(fā)表于 2025-3-22 16:35:49

Decomposing the requirement space of a transporation problem into polyhedral cones,part of the solution procedures for dynamic and stochastic programs. This usually involves a decomposition of the parameter space, a decomposition which is dictated by the optimality criteria. The subregions correspond to (sub) bases of the coefficient matrix. We suggest an efficient procedure to ge

只看該作者 · 發(fā)表于 2025-3-22 19:48:13

Multistage stochastic programs with block-separable recourse,ecourse. Examples of applications where this property can be found are given. The equivalence of multistage programs with block-separable recourse and two-stage programs is shown and the algorithmic implications of block-separability are studied.

只看該作者 · 發(fā)表于 2025-3-23 01:09:40

A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic prograought itself of high dimension, is approximated by a sequence of quadratic programming subproblems whose dimensionality can be kept low. These subproblems correspond to maximizing the dual objective over the convex hull of finitely many dual feasible solutions. An optimizing sequence is produced for

只看該作者 · 發(fā)表于 2025-3-23 04:32:19

只看該作者 · 發(fā)表于 2025-3-23 08:26:16

		自動(dòng)登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點(diǎn)評(píng)	投稿經(jīng)驗(yàn)總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2026-1-29 03:06
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved