Finding an optimal proximity bound in a very special scenario
Williams, Aled
(2022)
Finding an optimal proximity bound in a very special scenario
WSEAS Transactions on Mathematics, 21.
600 - 603.
ISSN 1109-2769
Given A ∈ Zm×n and b ∈ Zm, we provide a sharp upper bound for the ℓ∞-distance from any vertex of the polyhedron P(A, b) = {x ∈ Rn ≥0: Ax = b} to a nearby feasible integral point under a strong assumption regarding the dimensions of the matrix A. It is hoped that this result provides motivation for conducting further research into providing more such upper bounds under certain additional assumptions.
| Item Type | Article |
|---|---|
| Keywords | Integer programming,linear programming,optimisation,polyhedron,proximity |
| Departments | Mathematics |
| DOI | 10.37394/23206.2022.21.68 |
| Date Deposited | 28 Oct 2022 15:15 |
| URI | https://researchonline.lse.ac.uk/id/eprint/117207 |
Explore Further
- https://www.lse.ac.uk/Mathematics/people/Aled-Williams (Author)
- https://wseas.com/journals/mathematics/ (Official URL)
ORCID: https://orcid.org/0000-0001-7695-946X
