Full Record

Author | Adelgren, Nathan |

Title | Solution Techniques for Classes of Biobjective and Parametric Programs |

URL | https://tigerprints.clemson.edu/all_dissertations/1754 |

Publication Date | 2016 |

Degree | PhD |

Discipline/Department | Mathematical Science |

Degree Level | doctoral |

University/Publisher | Clemson University |

Abstract | Mathematical optimization, or mathematical programming, has been studied for several decades. Researchers are constantly searching for optimization techniques which allow one to de-termine the ideal course of action in extremely complex situations. This line of scientiﬁc inquiry motivates the primary focus of this dissertation — nontraditional optimization problems having either multiple objective functions or parametric input. Utilizing multiple objective functions al-lows one to account for the fact that the decision process in many real-life problems in engineering, business, and management is often driven by several conﬂicting criteria such as cost, performance, reliability, safety, and productivity. Additionally, incorporating parametric input allows one to ac-count for uncertainty in models’ data, which can arise for a number of reasons, including a changing availability of resources, estimation or measurement errors, or implementation errors caused by stor-ing data in a ﬁxed precision format. However, when a decision problem has either parametric input or multiple objectives, one cannot hope to ﬁnd a single, satisfactory solution. Thus, in this work we develop techniques which can be used to determine sets of desirable solutions. The two main problems we consider in this work are the biobjective mixed integer linear program (BOMILP) and the multiparametric linear complementarity problem (mpLCP). BOMILPs are optimization problems in which two linear objectives are optimized over a polyhedron while restricting some of the decision variables to be integer. We present a new data structure in the form of a modiﬁed binary tree that can be used to store the solution set of BOMILP. Empirical evidence is provided showing that this structure is able to store these solution sets more eﬃciently than other data structures that are typically used for this purpose. We also develop a branch-and-bound (BB) procedure that can be used to compute the solution set of BOMILP. Computational experiments are conducted in order to compare the performance of the new BB procedure with current state-of-the-art methods for determining the solution set of BOMILP. The results provide strong evidence of the utility of the proposed BB method. We also present new procedures for solving two variants of the mpLCP. Each of these proce-dures consists of two phases. In the ﬁrst phase an initial feasible solution to mpLCP which satisﬁes certain criteria is determined. This contribution alone is signiﬁcant because the question of how such an initial solution could be generated was previously unanswered. In the second phase the set of fea-sible parameters is partitioned into regions such that the solution of the mpLCP, as a function of the parameters, is invariant over each region. For the ﬁrst variant of mpLCP, the worst-case complex-ity of the presented procedure matches that of current state-of-the-art methods for nondegenerate problems and is lower than that of current state-of-the-art methods for degenerate problems. Addi-tionally, computational… |

Contributors | Dr. Akshay Gupte, Committee Co-Chair; Dr. Margaret M. Wiecek, Committee Co-Chair; Dr. Pietro Belotti; Dr. Christopher Cox; Dr. Matthew Saltzman |

Country of Publication | us |

Record ID | oai:tigerprints.clemson.edu:all_dissertations-2755 |

Repository | clemson |

Date Retrieved | 2020-04-30 |

Date Indexed | 2020-05-01 |