Type of Document Dissertation Author Desai, Jitamitra Author's Email Address firstname.lastname@example.org URN etd-07052005-124337 Title Solving Factorable Programs with Applications to Cluster Analysis, Risk Management, and Control Systems Design Degree PhD Department Industrial and Systems Engineering Advisory Committee
Advisor Name Title Sherali, Hanif D. Committee Chair Fraticelli, Barbara M. P. Committee Member Herdman, Terry L. Committee Member Koelling, Charles Patrick Committee Member Sarin, Subhash C. Committee Member Keywords
- global optimization
- factorable programs
- hard and fuzzy clustering
- risk management
- control systems
- nonconvex programs
- event trees
Date of Defense 2005-06-28 Availability unrestricted AbstractEver since the advent of the simplex algorithm, linear programming (LP) has been extensively used with great success in many diverse fields. The field of discrete optimization came to the forefront as a result of the impressive developments in the area of linear programming. Although discrete optimization problems can be viewed as belonging to the class of nonconvex programs, it has only been in recent times that optimization research has confronted the more formidable class of continuous nonconvex optimization problems, where the objective function and constraints are often highly nonlinear and nonconvex functions, defined in terms of continuous (and bounded) decision variables. Typical classes of such problems involve polynomial, or more general factorable functions.
This dissertation focuses on employing the Reformulation-Linearization Technique (RLT) to enhance model formulations and to design effective solution techniques for solving several practical instances of continuous nonconvex optimization problems, namely, the hard and fuzzy clustering problems, risk management problems, and problems arising in control systems.
Under the umbrella of the broad RLT framework, the contributions of this dissertation focus on developing models and algorithms along with related theoretical and computational results pertaining to three specific application domains. In the basic construct, through appropriate surrogation schemes and variable substitution strategies, we derive strong polyhedral approximations for the polynomial functional terms in the problem, and then rely on the demonstrated (robust) ability of the RLT for determining global optimal solutions for polynomial programming problems. The convergence of the proposed branch-and-bound algorithm follows from the tailored branching strategy coupled with consistency and exhaustive properties of the enumeration tree. First, we prescribe an RLT-based framework geared towards solving the hard and fuzzy clustering problems. In the second endeavor, we examine two risk management problems, providing novel models and algorithms. Finally, in the third part, we provide a detailed discussion on studying stability margins for control systems using polynomial programming models along with specialized solution techniques.
Filename Size Approximate Download Time (Hours:Minutes:Seconds)
28.8 Modem 56K Modem ISDN (64 Kb) ISDN (128 Kb) Higher-speed Access Desai_Dissertation.pdf 1.46 Mb 00:06:45 00:03:28 00:03:02 00:01:31 00:00:07
If you have questions or technical problems, please Contact DLA.