Ameso Optimization: a Relaxation of Discrete Midpoint Convexity

DOI10.1016/J.DAM.2020.11.004MaRDI QIDQ6310449arXivFDO

Authors Wen Chen, Odysseas Kanavetas, Michael N. Katehakis

Publication date 29 November 2018

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.DAM.2020.11.004

Mathematics Subject Classification ID

Integer programming (90C10)

arXiv classification

math.OC

Abstract: In this paper we introduce the Ameso optimization problem, a special class of discrete optimization problems. We establish its basic properties and investigate the relation between Ameso optimization and the convex optimization. Further, we design an algorithm to solve a multi-dimensional Ameso problem by solving a sequence of one-dimensional Ameso problems. Finally, we demonstrate how the knapsack problem can be solved using the Ameso optimization framework.

This page was built for publication: Ameso Optimization: a Relaxation of Discrete Midpoint Convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310449)