Publication:
A mixed integer programming formulation for the 1-maximin problem

Placeholder

School / College / Institute

Program

KU-Authors

KU Authors

Co-Authors

N/A

Publication Date

Language

Embargo Status

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

In this paper, I present a mixed integer programming (MIP) formulation for the 1-maximin problem with rectilinear distance. The problem mainly appears in facility location while trying to locate an undesirable facility. The rectilinear distance is quite commonly used in the location literature. Our numerical experiments show that one can solve reasonably large location problems using a standard MIP solver. We also provide a linear programming formulation that helps find an upper bound on the objective function value of the 1-maximin problem with any norm when extreme points of the feasible region are known. We discuss various extension alternatives for the MIP formulation.

Source

Publisher

Operational Research Society

Subject

Business administration

Citation

Has Part

Source

Journal of the Operational Research Society

Book Series Title

Edition

DOI

10.1057/palgrave.jors.2600878

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

4

Views

0

Downloads

View PlumX Details