2026-09-18T21:45:20Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/847142022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Dimitris J. Bertsimas. Culver, David M. (David Martin) Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Operations Research Center Sloan School of Management 2014-02-10T13:32:39Z 2014-02-10T13:32:39Z 2013 http://hdl.handle.net/1721.1/84714 868236701 Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2013. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student-submitted PDF version of thesis. Includes bibliographical references (pages 105-107). This thesis considers the tactical reconnaissance asset allocation problem in military operations. Specifically this thesis presents methods to optimize, under uncertain conditions, tactical reconnaissance asset allocation in order to maximize, within acceptable levels of asset risk exposure, the expected total information collection value. We propose a deterministic integer optimization formulation and two robust mixed-integer optimization extensions to address this problem. Robustness is applied to our model using both polyhedral and ellipsoidal uncertainty sets resulting in tractable mixed integer linear and second order cone problems. We show through experimentation that robust optimization leads to overall improvements in solution quality compared to non-robust and typical human generated plans. Additionally we show that by using our robust models, military planners can ensure better solution feasibility compared to non-robust planning methods even if they seriously misjudge their knowledge of the enemy and the battlefield. We also compare the trade-offs of using polyhedral and ellipsoidal uncertainty sets. In our tests our model using ellipsoidal uncertainty sets provided better quality solutions at a cost of longer average solution times to that of the polyhedral uncertainty set model. Lastly we outline a special case of our models that allows us to improve solution time at the cost of some solution quality. by David M. Culver. S.M. 107 pages eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Operations Research Center. Robust reconnaissance asset planning under uncertainty Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ca3990f6-ccf9-4d87-8e04-9f67876ecb43"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Robust reconnaissance asset planning under uncertainty</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2013</PublicationDate> <Authors> <Author> <DisplayName>Culver, David M. (David Martin)</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Operations Research Center.</Keyword> <Abstract>This thesis considers the tactical reconnaissance asset allocation problem in military operations. Specifically this thesis presents methods to optimize, under uncertain conditions, tactical reconnaissance asset allocation in order to maximize, within acceptable levels of asset risk exposure, the expected total information collection value. We propose a deterministic integer optimization formulation and two robust mixed-integer optimization extensions to address this problem. Robustness is applied to our model using both polyhedral and ellipsoidal uncertainty sets resulting in tractable mixed integer linear and second order cone problems. We show through experimentation that robust optimization leads to overall improvements in solution quality compared to non-robust and typical human generated plans. Additionally we show that by using our robust models, military planners can ensure better solution feasibility compared to non-robust planning methods even if they seriously misjudge their knowledge of the enemy and the battlefield. We also compare the trade-offs of using polyhedral and ellipsoidal uncertainty sets. In our tests our model using ellipsoidal uncertainty sets provided better quality solutions at a cost of longer average solution times to that of the polyhedral uncertainty set model. Lastly we outline a special case of our models that allows us to improve solution time at the cost of some solution quality.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>