Index

---

A - B - C - D - E - F - G - H - I - J - K - L - M - N - O - P - Q - R - S - T - U - V - W - X - Y - Z

A

abs   D.2.f36   C.2.2.2  

C

ceil   D.2.f36   C.2.2.2  

chance constraint   C.3.6  

E

E-105   E.3.e1  

E-108   E.3.e2  

E-109   E.3.e3  

E-110   E.3.e4  

E-111   E.3.e5  

E-116   E.3.e6  

E-117   E.3.e7  

E-118   E.3.e8  

E-120   E.3.e9  

E-123   E.3.e10  

E-133   E.3.e11  

E-134   E.3.e12  

E-135   E.3.e13  

E-136   E.3.e14  

E-137   E.3.e15  

E-138   E.3.e16  

E-139   E.3.e17  

E-140   E.3.e18  

E-141   E.3.e19  

E-143   E.3.e20  

E-145   E.3.e21  

E-146   E.3.e22  

E-148   E.3.e23  

E-149   E.3.e24  

E-151   E.3.e25  

E-152   E.3.e26  

E-153   E.3.e27  

E-155   E.3.e28  

EV   see   expected value    

exp   C.2.2.2  

expected value problem   C.1.6.2  

F

floor   D.2.f36   C.2.2.2  

G

getdual   D.2.f16   C.2.2.2  

getdualatnode   D.2.f16   C.2.2.2  

getdualinscen   D.2.f16   C.2.2.2  

getobjval   D.2.f12   C.2.2.2  

getrcost   D.2.f15   C.2.2.2  

getrcostatnode   D.2.f15   C.2.2.2  

getrcostinscen   D.2.f15   C.2.2.2  

getslack   D.2.f17   C.2.2.2  

getslackatnode   D.2.f17   C.2.2.2  

getslackinscen   D.2.f17   C.2.2.2  

getsol   D.2.f14   C.2.2.2  

getsolatnode   D.2.f14   C.2.2.2  

getsolinscen   D.2.f14   C.2.2.2  

global constraint   C.3.6  

I

inner linearization   E.1  

IVE   C.3.7  

L

ln   C.2.2.2  

L-shaped method   E.1  

M

maximize   D.2.f11   C.2.2.2  

maximum   D.2.f35   C.2.2.2  

minimize   D.2.f11   C.2.2.2  

minimum   D.2.f35   C.2.2.2  

N

nested decomposition   E.1  

O

outer linearization   E.1  

P

perfect information problem   C.1.6.3  

PI   see   perfect information    

R

recourse problem   C.1.6.1  

round   C.2.2.2  

S

scenario tree   C.1.3  

SP   see   Stochastic Programming    

spaddchildren   D.2.f7   C.2.2.2  

spaggregate   D.2.f32   C.2.2.2  

spcreatetree   D.2.f5   C.2.2.2  

spdelscen   D.2.f31   C.2.2.2  

speval   D.2.f18   C.2.2.2  

spexportprob   D.2.f34   C.2.2.2  

spfix   D.2.f19   C.2.2.2  

spgenexh   D.2.f4  

spgenexhtree   C.2.2.2  

spgentree   D.2.f10   C.2.2.2  

spgetchild   D.2.f30   C.2.2.2  

spgetchildrencount   D.2.f29   C.2.2.2  

spgetnodecount   D.2.f24   C.2.2.2  

spgetobjconst   D.2.f13  

spgetparent   D.2.f28   C.2.2.2  

spgetprobcond   D.2.f25   C.2.2.2  

spgetprobscen   D.2.f27   C.2.2.2  

spgetprobuncond   D.2.f26   C.2.2.2  

spgetscencount   D.2.f23   C.2.2.2  

spgetxprsintattrib   C.2.2.2  

spgetxprsrealattrib   C.2.2.2  

spgetxprsstrattrib   C.2.2.2  

spif   D.2.f37   C.2.2.2  

spprinttree   D.2.f33   C.2.2.2  

spsetdist   D.2.f3   C.2.2.2  

spsethidden   D.2.f21   C.2.2.2  

spsetname   D.2.f38   C.2.2.2  

spsetprobcond   D.2.f6   C.2.2.2  

spsetprobcondatnode   D.2.f9   C.2.2.2  

spsetprobscen   D.2.f8   C.2.2.2  

spsetrand   D.2.f6   C.2.2.2  

spsetrandatnode   D.2.f9   C.2.2.2  

spsetstage   D.2.f2   C.2.2.2  

spsetstages   D.2.f1   C.2.2.2  

spsettype   D.2.f22   C.2.2.2  

spunfix   D.2.f20   C.2.2.2  

spwriteprob   C.2.2.2  

Stochastic Programming   2  

W

W-100   E.3.e29  

W-101   E.3.e30  

W-102   E.3.e31  

W-103   E.3.e32  

W-104   E.3.e33  

W-105   E.3.e34  

W-106   E.3.e35  

W-107   E.3.e36   E.3.e44  

W-108   E.3.e37  

W-109   E.3.e38  

W-110   E.3.e39  

W-111   E.3.e40  

W-112   E.3.e41  

W-113   E.3.e42  

W-114   E.3.e43  

W-115   E.3.e45  

W-116   E.3.e46  

X

XSP_BARRIER   C.2.2.4   C.3.4.2.3  

xsp_cblog   C.2.2.3  

xsp_cond_prob   C.2.2.3   D.3.p9  

XSP_COND_PROB   C.3.5  

xsp_create_tree   C.2.2.3   D.3.p10  

XSP_CREATE_TREE   C.3.5  

xsp_disp_warnings   C.2.2.3   D.3.p4  

XSP_DISP_WARNINGS   C.3.5  

XSP_DUAL   C.2.2.4   C.3.4.2.3  

XSP_EV   C.2.2.4   C.3.4.2.3  

xsp_ftable   C.2.2.3  

XSP_GLOBAL   C.2.2.4  

xsp_implicit_stage   C.2.2.3   D.3.p2  

XSP_IMPLICIT_STAGE   C.3.5  

xsp_ive_enable   C.2.2.3   D.3.p6  

XSP_IVE_ENABLE   C.3.5  

xsp_loadnames   C.2.2.3   D.3.p7  

XSP_LOADNAMES   C.3.5  

XSP_LP_CUTOFF   C.2.2.4   C.3.4.4  

XSP_LP_CUTOFF_IN_DUAL   C.2.2.4   C.3.4.4  

XSP_LP_INFEAS   C.2.2.4   C.3.4.4  

XSP_LP_OPTIMAL   C.2.2.4   C.3.4.4  

XSP_LP_UNBOUNDED   C.2.2.4   C.3.4.4  

XSP_LP_UNFINISHED   C.2.2.4   C.3.4.4  

XSP_MAX   C.2.2.4  

XSP_MIN   C.2.2.4  

XSP_MIP_INFEAS   C.2.2.4   C.3.4.4  

XSP_MIP_LP_NOT_OPTIMAL   C.2.2.4   C.3.4.4  

XSP_MIP_LP_OPTIMAL   C.2.2.4   C.3.4.4  

XSP_MIP_NO_SOL_FOUND   C.2.2.4   C.3.4.4  

XSP_MIP_NOT_LOADED   C.2.2.4   C.3.4.4  

XSP_MIP_OPTIMAL   C.2.2.4   C.3.4.4  

XSP_MIP_SOLUTION   C.2.2.4   C.3.4.4  

XSP_OPT_LP_ONLY   C.2.2.4   C.3.4.2.3  

XSP_PI   C.2.2.4   C.3.4.2.3  

XSP_PRIMAL   C.2.2.4   C.3.4.2.3  

xsp_re_init   C.2.2.3   D.3.p5  

XSP_RE_INIT   C.3.5  

XSP_REC   C.2.2.4   C.3.4.2.3  

xsp_scale_probs   C.2.2.3   D.3.p8  

XSP_SCALE_PROBS   C.3.5  

xsp_scen_based   C.2.2.3   D.3.p1  

XSP_SCEN_BASED   C.3.5  

XSP_SMPS_FREE   C.2.2.4  

XSP_STAGE_ZERO   C.2.2.4  

xsp_tolprob_lb   C.2.2.3   D.3.p11  

XSP_TOLPROB_LB   C.3.5  

xsp_tolprob_totlb   C.2.2.3   D.3.p13  

XSP_TOLPROB_TOTLB   C.3.5  

xsp_tolprob_totub   C.2.2.3   D.3.p14  

XSP_TOLPROB_TOTUB   C.3.5  

xsp_tolprob_ub   C.2.2.3   D.3.p12  

XSP_TOLPROB_UB   C.3.5  

xsp_verbose   C.2.2.3   D.3.p3  

XSP_VERBOSE   C.3.5  

XSP_X_LP   C.2.2.4  

XSP_X_SMPS   C.2.2.4  

XSP_X_SP   C.2.2.4  

xsp_xprs_prob   C.2.2.3