Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

一类机会约束规划可行集合的凸性研究

One of the major problems with chance-constrained programming is whether the constrained set X ( α) or X i (αi ) is convex. This Paper discusses about several convexity statements as to whether all the elements of A(w) are independent random variables with known normal distributions, and whether b(w) is fixed by using the method of sub-convex function.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved