Now showing items 1-6 of 6
Optimizing over the cut cone: A new polyhedral algorithm for the maximum-weight cut problem
Polyhedral cutting-plane algorithms for hard combinatorial problems have scored notable successes. However, computational research on the Maximum-Weight Cut Problem (MCP) on undirected graphs has been inconclusive. In 1988, ...
Solving structured 0/1 integer programs arising from truck dispatching scheduling problems
A branch-and-cut IP solver is developed for a class of structured 0/1 integer programs arising from a truck dispatching scheduling problem. This problem is characterized by a group of set partitioning constraints and a ...
Solving very large scale school/student assignment problems
Currently, the Houston Independent School District has approximately 175 elementary schools providing education for more than 110,000 students. A question of major logistical impact is how to assign students to schools in ...
Exact and inexact Newton linesearch interior-point algorithms for nonlinear programming problems
In the first part of this research we consider a linesearch globalization of the local primal-dual interior-point Newton's method for nonlinear programming recently introduced by El-Bakry, Tapia, Tsuchiya, and Zhang. Our ...
Nonlinear multicriteria optimization and robust optimality
This dissertation attempts to address two important problems in systems engineering, namely, multicriteria optimization and robustness optimization. In fields ranging from engineering to the social sciences designers are ...
Trust-region interior-point algorithms for a class of nonlinear programming problems
This thesis introduces and analyzes a family of trust-region interior-point (TRIP) reduced sequential quadratic programming (SQP) algorithms for the solution of minimization problems with nonlinear equality constraints and ...