Polynomial and indefinite quadratic programming problems: algorithms and applications

• Main Author: Tuncbilek, Cihan H.
• Other Authors: Industrial and Systems Engineering
• Format: Others
• Language: en
• Published: Virginia Tech 2014
• Subjects: LD5655.V856 1994.T863; Quadratic programming
• Online Access: http://hdl.handle.net/10919/39040; http://scholar.lib.vt.edu/theses/available/etd-08032007-142137/

This dissertation is concerned with the global optimization of polynomial programming problems, and a detailed treatment of its particular special case, the indefinite quadratic programming problem. Polynomial programming problems are generally nonconvex, involving the optimization of a polynomial objective function over a compact feasible region defined in terms of polynomial constraints. These problems arise in a variety of applications in the context of engineering design and chemical process design situations. Despite the wide applicability of these classes of problems, there is a significant gap between the theory and practice in this field, principally due to the challenge faced in solving these rather difficult problems. The purpose of this dissertation is to introduce new solution strategies that assist in closing this gap. For solving polynomial programming problems, we present a branch and bound algorithm that uses a Reformulation Linearization Technique (RLT) to generate tight linear programming relaxations. This bounding scheme involves an automatic reformulation of the problem via the addition of certain nonlinear implied constraints that are generated by using the products of the simple bounding restrictions and, optionally, products involving the structural constraints. Subsequently, in a linearization phase, each distinct nonlinear term in the resulting problem is replaced by a new variable to obtain a linear program. The underlying purpose of this procedure is to closely approximate the convex envelope of the objective function over the convex hull of the feasible region. Various implementation issues regarding the derivation of such a bounding problem using the RLT, and the dominance of such bounds over existing alternative schemes, are investigated, both the- theoretically and computationally. The principal thrust of the proposed method is to construct a tight linear programming relaxation of the problem via an appropriate RLT procedure, and to use this in concert with a suitable partitioning strategy, in order to derive a practically effective algorithm that is theoretically guaranteed to be globally convergent. To address various implementation issues, empirical experiments are conducted using several test problems from the literature, many motivated by the aforementioned practical applications. Our results on solving several such practical engineering design problems demonstrate the viability of the proposed approach. This approach is also specialized and further enhanced for the particular class of indefinite (and concave) quadratic programming problems. These problems are important in their own right, and arise in many applications such as in modelling economies of scale in a cost structure, in location-allocation problems, several production planning and risk management problems, and in various other mathematical models such as the maximum clique problem and the jointly constrained bilinear programming problem. The proposed algorithm is more than just a specialization of the polynomial programming approach; it involves new, nontrivial extensions that exploit the particular special structure of the problem, along with many additional supporting features that improve the computational efficiency of the procedure. Certain types of nonlinearities are also retained and handled implicitly within the bounding problem to obtain sharper bounds. Computational results are presented on a set of test problems from the literature to demonstrate the efficiency of the approach. (One of these test problems had not previously been solved to optimality.) It is shown that for many problems, including randomly generated problems having up to 50 variables, the initial relaxation itself produces an optimal or a near optimal solution. This is significant in that the proposed methodology affords an approach whereby such hard nonconvex problems can be practically solved via a single or a few higher dimensional linear programming problems. === Ph. D.