This thesis deals with two basic issues in resource allocation problems. The first issue pertains to how one approaches the problem of designing the "right" objective for a given resource allocation problem. The notion of ...

We present a faster implementation of the polynomial time primal simplex algorithm due to Orlin [23]. His algorithm requires O(nm min{log(nC), m log n}) pivots and O(n2 m ??n{log nC, m log n}) time. The bottleneck operations ...

A basic result in ordinary (Lagrange) convex programming is the saddlepoint duality theorem concerning optimization problems with convex inequalities and linear-affine equalities satisfying a Slater condition. This note ...

This thesis considers the problem of optimally influencing social networks in Afghanistan as part of ongoing counterinsurgency efforts. The social network is analyzed using a discrete time agent based model. Each agent has ...

In this paper, we introduce a fluid model of dynamic pricing and inventory management for make-to-stock manufacturing systems. Instead of considering a traditional model that is based on how price affects demand, we consider ...

Our work is motivated by real-world planning challenges faced by a manufacturer of industrial products. In the first part of the thesis, we study a multi-product serial-flow production line that operates in a low-volume, ...

This thesis is divided into two parts sharing the common theme of fully polynomial time approximation schemes. In the first part, we introduce a generic approach for devising fully polynomial time approximation schemes for ...