Relaxation and exact algorithms for solving mixed integer-quadratic optimization problems
Name
44815245-MIT.pdf
Description
Full printable version
Size
8.66 MB
Format
Adobe PDF
Checksum (MD5)
c6d6922041adf8c11f59ffa7d385ebe4
Author(s)
Tziligakis, Constantine Nikolaos
Advisor(s)
Dimitris Bertsimas.
Date Issued
1999
Publisher
Massachusetts Institute of Technology
Abstract
We develop various algorithms for solving mixed integer-quadratic problems. These problems exhibit exponential complexity resulting from the presence of integer variables. Traditional approaches that apply in pure integer programming are not very helpful, since the existence of continuous variables in our problems complicates their use. Vie develop relaxation and heuristic algorithms designed so as to provide tight lower and upper bounds to the optimal solution of the mixed combinatorial problem. In some cases the obtained range, in which the optimum lies, is small enough to be considered satisfactory by itself. This has been accomplished in problems with up to 150 variables. Exact algorithms have also been developed and guarantee the optimal solution upon termination. The idea of Branch and Bound enhanced with the use of lower and upper bounds obtained with the aforementioned methods is implemented for that purpose. Problems with up to 70 variables have been solved. Our ideas and algorithms are applied to the Problem of Index and Portfolio Replication with a limited number of assets. This problem arises in Finance, but, in its more general form, can find application in various areas ranging from Statistics to Optimal Control and Manufacturing.
Description
Thesis (S.M.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 1999.
Includes bibliographical references (leaves 107-111).
Subjects
Operations Research Center.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Sloan School of Management
Terms of Use
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.
Persistent DSpace Link
