*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Thesis Title: Techniques for Multiobjective Optimization with Discrete Variables: Boxed Line Method and Tchebychev Weight Set Decomposition
Advisor:
Dr. Natashia Boland, School of Industrial and Systems Engineering, Georgia Tech
Committee Members:
Dr. Martin Savelsbergh, School of Industrial and Systems Engineering, Georgia Tech
Dr. Santanu Dey, School of Industrial and Systems Engineering, Georgia Tech
Dr. Pascal Van Hentenryck, School of Industrial and Systems Engineering, Georgia Tech
Dr. Amy Langville, Department of Mathematics, The College of Charleston
Date and Time: June 9th, 2021 8:00 PM
Meeting URL: https://bluejeans.com/2975069046
Summary:
Many real-world applications involve multiple competing objectives, but due to conflict between the objectives, it is generally impossible to find a feasible solution that optimizes all, simultaneously. In contrast to single objective optimization, the goal in multiobjective optimization is to generate a set of solutions that induces the nondominated (ND) frontier. This thesis presents two techniques for multiobjective optimization problems with discrete decision variables.
First, the Boxed Line Method is an exact, criterion space search algorithm for biobjective mixed integer programs (Chapter 2). A basic version of the algorithm is presented with a recursive variant and other enhancements. The basic and recursive variants permit complexity analysis, which yields the first complexity results for this class of algorithms. Additionally, a new instance generation method is presented, and a rigorous computational study is conducted.
Second, a novel weight space decomposition method for integer programs with three (or more) objectives is presented with unique geometric properties (Chapter 3). The weighted Tchebychev scalarization used for this weight space decomposition provides the benefit of including unsupported ND images but at the cost of convexity of weight set components. This work proves convexity-related properties of the weight space components, including star-shapedness. Further, a polytopal decomposition is used to properly define dimension for these nonconvex components.
Finally, the weighted Tchebychev weight set decomposition is then applied as a “dual” perspective on the class of multiobjective “primal” algorithms (Chapter 4). It is shown that existing algorithms do not yield enough information for a complete decomposition, and the necessary modifications required to yield the missing information is proven. Modifications for primal algorithms to compute inner and outer approximations of the weight space components are presented. Lastly, a primal algorithm is restricted to solving for a subset of the ND frontier, where this subset represents the compromise between multiple decision makers' weight vectors.
