is not Poisson. Also, given a structural weekly admission pattern, we apply a timedependent analysis to determine the mean offered load per day. This time-dependent analysis is combined with a Quadratic Programming model to determine the optimal number of elective admissions per day, such that an average desired

this paper we examine the underlying ideas of the SQP method and the theory that establishes it as a framework from which effective algorithms can

conjugate-gradient based approach for approximate solutions of

view by generating smaller and smaller subproblems. In contrast, GORDIAN maintains the simultaneous treatment of all cells over all global optimization steps, thereby considering constraints that reflect the current dissection of the circuit. The global optimizations are performed by solving quadratic

ABSTRACT. This paper describes a software package, called LOQO, which implements a primaldual interior-point method for general nonlinear programming. We focus in this paper mainly on the algorithm as it applies to linear and quadratic programming with only brief mention of the extensions to convex

programming problem with bounded variables. The regularization technique for the ill-posed system is to replace the consistent system of the quadratic programming problem by an approximate system of smaller rank. The rank which gives a best or near-best solution is estimated. This method is a novel one

Sequential (or Successive) Quadratic Programming (SQP) is a technique for the solution of Nonlinear Programming (NLP) problems. It is, as we shall see, an idealized concept, permitting and indeed necessitating many variations and modifications before becoming available as part of a reliable

Techniques for the preprocessing of (not-necessarily convex) quadratic programs are discussed. Most of the procedures extend known ones from the linear to quadratic cases, but a few new preprocessing techniques are introduced. The implementation aspects are also discussed. Numerical results

This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, 1} n that maximizes x T Mx. This problem recently attracted attention due to its application in various clustering settings, as well

We consider the problem of approximating the global maximum of a quadratic program (QP) with n variables subject to bound constraints. Based on the results of Goemans and Williamson [4] and Nesterov [6], we show that a 4=7 approximate solution can be obtained in polynomial time. Key words