Search
Now showing items 1-4 of 4
A subgradient algorithm for nonlinear integer programming and its parallel implementation
(1991)
This work concerns efficiently solving a class of nonlinear integer programming problems: min $\{f(x)$: $x \in \{0,1\}\sp{n}\}$ where $f(x)$ is a general nonlinear function. The notion of subgradient for the objective ...
A modified augmented Lagrangian merit function, and Q-superlinear characterization results for primal-dual Quasi-Newton interior-point method for nonlinear programming
(1997)
Two classes of primal-dual interior-point methods for nonlinear programming are studied. The first class corresponds to a path-following Newton method formulated in terms of the nonnegative variables rather than all primal ...
Robust model predictive control as a class of semi-infinite programming problems
(1999)
This thesis introduces a new interpretation of the problems arising in robust model predictive control (MPC). In practice, MPC algorithms are typically embedded within a multi-level hierarchy of control functions. The MPC ...
A computational study of vehicle routing applications
(1999)
This thesis examines three specific routing applications. In the first model, the scheduling of home health care providers from their homes, to a set of patients, and then back to their respective homes, is performed both ...