Using l^p-norms for Fairness in Combinatorial Optimisation

Bektas, Tolga ORCID: 0000-0003-0634-144X and Letchford, Adam N (2020) Using l^p-norms for Fairness in Combinatorial Optimisation Computers and Operations Research, 120. p. 104975. ISSN 0305-0548, 1873-765X

Text Fairness_in_Combinatorial_Optimisation.pdf - Author Accepted Manuscript Download (342kB) | Preview

Abstract

The issue of fairness has received attention from researchers in many fields, including combinatorial optimisation. One way to drive the solution toward fairness is to use a modified objective function that involves so-called l^p-norms. If done in a naive way, this approach leads to large and symmetric mixed-integer nonlinear programs (MINLPs), that may be difficult to solve. We show that, for some problems, one can obtain alternative MINLP formulations that are much smaller, do not suffer from symmetry, and have a reasonably tight continuous relaxation. We give encouraging computational results for certain vehicle routing, facility location and network design problems.

Item Type:	Article
Uncontrolled Keywords:	fairness, mixed-integer nonlinear programming, vehicle routing, facility location, network design
Depositing User:	Symplectic Admin
Date Deposited:	24 Apr 2020 13:07
Last Modified:	01 Mar 2026 05:27
DOI:	10.1016/j.cor.2020.104975
Related Websites:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3084008
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.