Skip to main content

DISCRETE CATS SEMINAR

Discrete Seminar

Title: Equitable Facility Location

Abstract: Facility location is one of the most common applications of combinatorial optimization. Models that minimize the mean distance between a “customer” and their assigned facility behave well computationally and make sense from a modeling perspective in many contexts. However, if equity is a concern, the mean is not an ideal metric. Many equitable facility location models have been developed in the literature, but they tend not to scale well computationally because nonlinear optimization models with integer variables are very hard to solve. Historically applied to incomes, equally distributed equivalents (EDEs) provide more accurate measures of the experience of a population than the population mean by penalizing values on the “bad” end of the distribution; i.e., very low incomes pull the EDE below the mean.  We develop a computationally scalable facility location model that minimizes the Kolm-Pollak EDE, a metric that is applied in the Environmental Justice literature to compare exposure to environmental harms, such as air pollution, across demographic groups. We apply our methods to food deserts and election polling locations, demonstrating that optimizing over the Kolm-Pollak EDE, rather than the mean, can lead to big gains in equity while still resulting in near-optimal average distances.

Date:
-
Location:
POT 745
Event Series:

Discrete CATS Seminar

Speaker:  William Dugan, U Mass Amherst

Title:        Faces of generalized Pitman-Stanley polytopes

Abstract:

The Pitman-Stanley polytope is a polytope whose integer

lattice points biject onto the set of plane partitions of a certain

shape with entries in {0 ,1}. In their original paper, Pitman and

Stanley further suggest a generalization of their construction depending

on $m \in {\mathbb N}$ whose integer lattice points biject onto the set

of plane partitions of the same shape having entries in  $\{ 0 , 1, ...

, m \}$. In this talk, we give further details of this

generalized Pitman-Stanley polytope, $PS_n^m(\vec{a})$,

demonstrating that it can be realized as the flow polytope of a certain

graph. We then use the theory of flow polytopes to describe the faces of

these polytopes and produce a recurrence for their f-vectors.

William Dugan is a student of Alejandro Morales who is funding this visit.

Date:
Location:
745 POT
Event Series: