Open Access. Powered by Scholars. Published by Universities.®

Business Commons

Open Access. Powered by Scholars. Published by Universities.®

Management Sciences and Quantitative Methods

University of Tennessee, Knoxville

Optimization

Publication Year

Articles 1 - 2 of 2

Full-Text Articles in Business

Joint Optimization Of Allocation And Release Policy Decisions For Surgical Block Time Under Uncertainty, Mina Loghavi Dec 2015

Joint Optimization Of Allocation And Release Policy Decisions For Surgical Block Time Under Uncertainty, Mina Loghavi

Doctoral Dissertations

The research presented in this dissertation contributes to the growing literature on applications of operations research methodology to healthcare problems through the development and analysis of mathematical models and simulation techniques to find practical solutions to fundamental problems facing nearly all hospitals.

In practice, surgical block schedule allocation is usually determined regardless of the stochastic nature of case demand and duration. Once allocated, associated block time release policies, if utilized, are often simple rules that may be far from optimal. Although previous research has examined these decisions individually, our model considers them jointly. A multi-objective model that characterizes financial, temporal, …


Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong May 2014

Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong

Doctoral Dissertations

Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if the QP is nonconvex or includes integer variables, the problem is NP-hard. Therefore, no known algorithm can solve such QPs efficiently. Alternatively, row-aggregation and diagonalization techniques have been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints. …