The single-row facility layout problem <Emphasis FontCategory="NonProportional">(SRFLP) is an NP-hard combinatorial optimization problem that is concerned with the arrangement of n departments of given lengths on a line so as to minimize the weighted sum of the distances between department pairs. <Emphasis FontCategory="NonProportional">(SRFLP) is the one-dimensional version...</emphasis></emphasis>

Let a society’s unhappiness be measured by the aggregate of the levels of relative deprivation of its members. When two societies of equal size, F and M, merge, unhappiness in the merged society is shown to be higher than the sum of the levels of unhappiness in the constituent societies when...

We consider semidefinite programs, where all the matrices defining the problem commute. We show that in this case the semidefinite program can be solved through an ordinary linear program. As an application, we consider the max-cut problem, where the underlying graph arises from an association...