Spelling suggestions: "subject:"stochastic programming."" "subject:"ctochastic programming.""
21 
Stochastic programming applied to reservoir operationsSharda, Ramesh. January 1981 (has links)
Thesis (Ph. D.)University of WisconsinMadison, 1981. / Typescript. Vita. eContent providerneutral record in process. Description based on print version record. Includes bibliographical references (leaves 9195).

22 
Stochastic vehicle routing problems with random travel times /Kenyon, Astrid Sandrine, January 1998 (has links)
Thesis (Ph. D.)University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 167194). Available also in a digital version from Dissertation Abstracts.

23 
Optimizing loblolly pine management with stochastic dynamic programming /Häring, Thomas W., January 1993 (has links)
Thesis (Ph. D.)Virginia Polytechnic Institute and State University, 1993. / Vita. Abstract. Includes bibliographical references (leaves 224238). Also available via the Internet.

24 
Single and multipleobjective stochastic programming models with applications to aerodynamicsCroicu, AnaMaria. Hussaini, M. Yousuff. January 2005 (has links)
Thesis (Ph. D.)Florida State University, 2005. / Advisor: M. Yousuff Hussaini, Florida State University, College of Arts and Sciences, Dept. of Mathematics. Title and description from dissertation home page (viewed Jan. 25, 2006). Document formatted into pages; contains xii, 178 pages. Includes bibliographical references.

25 
Monte Carlo samplingbased methods in stochastic programmingBayraksan, Güzin, Morton, David P., January 2005 (has links) (PDF)
Thesis (Ph. D.)University of Texas at Austin, 2005. / Supervisor: David P. Morton. Vita. Includes bibliographical references.

26 
Finitely convergent methods for solving stochastic linear programming and stochastic network flow problemsQi, Liqun. January 1984 (has links)
Thesis (Ph. D.)University of WisconsinMadison, 1984. / Typescript. Vita. eContent providerneutral record in process. Description based on print version record. Includes bibliographical references (leaves 126128).

27 
Bilevel factor analysis modelsPietersen, Jacobus Johannes 20 December 2007 (has links)
The theory of ordinary factor analysis and its application by means of software packages do not make provision for data sampled from populations with hierarchical structures. Since data are often obtained from such populations  educational data for example ¬the lack of procedures to analyse data of this kind needs to be addressed. A review of the ordinary factor analysis model and maximum likelihood estimation of the parameters in exploratory and confirmatory models is provided, together with practical applications. Subsequently, the concept of hierarchically structured populations and their models, called multilevel models, are introduced. A general framework for the estimation of the unknown parameters in these models is presented. It contains two estimation procedures. The first is the marginal maximum likelihood method in which an iterative expected maximisation approach is used to obtain the maximum likelihood estimates. The second is the Fisher scoring method which also provides estimated standard errors for the maximum likelihood parameter estimates. For both methods, the theory is presented for unconstrained as well as for constrained estimation. A twostage procedure  combining the mentioned procedures  is proposed for parameter estimation in practice. Multilevel factor analysis models are introduced next, and subsequently a particular twolevel factor analysis model is presented. The general estimation theory that was presented earlier is applied to this model  in exploratory and confirmatory analysis. First, the marginal maximum likelihood method is used to obtain the equations for determining the parameter estimates. It is then shown how an iterative expected max¬imisation algorithm is used to obtain these estimates in unconstrained and constrained optimisation. This method is applied to real life data using a FORTRAN program. Secondly, equations are derived by means of the Fisher scoring method to obtain the maximum likelihood estimates of the parameters in the twolevel factor analysis model for exploratory and confirmatory analysis. A FORTRAN program was written to apply this method in practice. Real life data are used to illustrate the method. Finally, flowing from this research, some areas for possible further research are pro¬posed. / Thesis (PhD (Applied Statistics))University of Pretoria, 2007. / Statistics / unrestricted

28 
Portfolio optimization using stochastic programming with market trend forecastYang, Yutian, active 21st century 02 October 2014 (has links)
This report discusses a multistage stochastic programming model that maximizes expected ending time profit assuming investors can forecast a bull or bear market trend. If an investor can always predict the market trend correctly and pick the optimal stochastic strategy that matches the real market trend, intuitively his return will beat the market performance. For investors with different levels of prediction accuracy, our analytical results support their decision of selecting the highest return strategy. Real stock prices of 154 stocks on 73 trading days are collected. The computational results verify that accurate prediction helps to exceed market return while portfolio profit drops if investors partially predict or forecast incorrectly part of the time. A sensitivity analysis shows how risk control requirements affect the investor's decision on selecting stochastic strategies under the same prediction accuracy. / text

29 
Task Optimization and Workforce SchedulingShateri, Mahsa 31 August 2011 (has links)
This thesis focuses on task sequencing and manpower scheduling to develop robust schedules for an aircraft manufacturer. The production of an aircraft goes through a series of multiple workstations, each consisting of a large number of interactive tasks and a limited number of working zones. The duration of each task varies from operator to operator, because most operations are performed manually. These factors limit the ability of managers to balance, optimize, and change the statement of work in each workstation. In addition, engineers spend considerable amount of time to manually develop schedules that may be incompatible with the changes in the production rate.
To address the above problems, the current state of work centers are first analyzed. Then, several deterministic mathematical programming models are developed to minimize the total production labour cost for a target cycle time. The mathematical models seek to find optimal schedules by eliminating and/or considering the effect of overtime on the production cost. The resulting schedules decrease the required number of operators by 16% and reduce production cycle time of work centers by 53% to 67%. Using these models, the time needed to develop a schedule is reduced from 36 days to less than a day.
To handle the stochasticity of the task durations, a twostage stochastic programming model is developed to minimize the total production labour cost and to find the number of operators that are able to work under every scenario. The solution of the twostage stochastic programming model finds the same number of operators as that of the deterministic models, but reduces the time to adjust production schedules by 88%.

30 
Deterministic approximations in stochastic programming with applications to a class of portfolio allocation problemsDokov, Steftcho Pentchev. January 2001 (has links)
Thesis (Ph. D.)University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI/Dissertation Abstracts International.

Page generated in 0.1343 seconds