Show simple item record

dc.contributor.advisorSubasi, Munevver Mine
dc.contributor.authorBinmahfoudh, Ahmed Mohammed
dc.date.accessioned2017-05-03T13:23:43Z
dc.date.available2017-05-03T13:23:43Z
dc.date.issued2017-04
dc.identifier.urihttp://hdl.handle.net/11141/1393
dc.descriptionThesis (Ph.D.) - Florida Institute of Technology, 2017en_US
dc.description.abstractThe contribution of the shape information of the underlying distribution in probability bounding problem is investigated and an efficient linear programming based bounding methodology, which takes advantage of the advanced optimization techniques, probability theory, and the state-of-the-art tools, to obtain robust and efficiently computable bounds for the probabilities that at least k and exactly k-out-of-n events occur is developed. The k-out-of-n type probability bounding problem is formulated as linear programs under the assumption that the probability distribution is unimodal. The dual feasible bases structures of the relaxed versions of linear programs involved are fully described. The bounds for the probability that at least k and exactly k-out-of-n events occur are obtained in the form of formulas. A dual based linear programming algorithm is proposed to obtain bounds as the customized algorithmic solutions of the LP’s formulated. Numerical examples are presented to show that the use of shape constraint significantly improves on the bounds for the probabilities that at least k and exactly k-out-of-n events occur when only first a few binomial moments are known. An application in PERT, where the shape of the underlying probability distribution can be used to obtain bounds for the distribution of the critical path length, is presented.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.rightsCopyright held by author.en_US
dc.titleNew Bounds for the k-out-of-n Type Probabilities and Their Applicationsen_US
dc.typeDissertationen_US
dc.date.updated2017-05-01T19:05:59Z
thesis.degree.nameDoctorate of Philosophy in Operations Researchen_US
thesis.degree.levelDoctoralen_US
thesis.degree.disciplineOperations Researchen_US
thesis.degree.departmentMathematical Sciencesen_US
thesis.degree.grantorFlorida Institute of Technologyen_US
dc.type.materialtext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record