| R.T. Rockafellar and R.J-B Wets. The optimal recourse problem in discrete time: -multipliers for inequality constraints. SIAM J. Control and Optimization, 161: 16--36, 1978. |
.... complete recourse is a type of constraint qualification that was used along with the strict to invoke the duality theorems which currently comprise the theoretical stochastic programming literature, brought about in the latter half of the 1970 s by Eisner and Olsen [3] and Rockafellar and Wets [10, 8, 12]. The approach here forgoes both strict feasibility and relatively complete recourse for a constraint qualification of a di#erent nature. The problem is said to have direction free feasibility if it is feasible and the recession cone of K 1 K 2 , K 1 K 2 ] # : K 2 for all ....
R.T. Rockafellar and R.J-B Wets. The optimal recourse problem in discrete time: -multipliers for inequality constraints. SIAM J. Control and Optimization, 161: 16--36, 1978.
No context found.
R.T. Rockafellar and R.J-B Wets. The optimal recourse problem in discrete time: -multipliers for inequality constraints. SIAM J. Control and Optimization, 161: 16--36, 1978.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC