An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

Operations-Research-Optimization-Modeling-Portfolio A curated portfolio of Optimization and Operations Research projects built during my coursework at The George Washington University. This repository ...

In this paper, a decision problem involving a car parts manufacturing company is modeled in order to prepare the company for an increase in demand. Mixed-integer linear programming was used with the ...

Solving this constrained optimization problem is difficult due to its nonconvex constraints. Nevertheless, by applying a series of transformations, we reveal that it is possible to find an equivalent ...

This paper treats a Markov decision problem with an infinite planning horizon and no discounting. This model is analyzed by application, perhaps repeated, of a simple linear program.

Two methods are used in the solution of the problem. The first method is a quadratic programming technique combined with a linear programming redispatch technique. The latter utilizes a linear ...