A Convex Maximization Problem: Discrete Case

Convex programming (90C25) Linear programming (90C05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Recurrences (11B37) Sequences and sets (11B99) Additive number theory; partitions (11P99) Elementary number theory (11A99)

Abstract: We study a specific convex maximization problem in n-dimensional space. The conjectured solution is proved to be a vertex of the polyhedral feasible region, but only a partial proof of local maximality is known. Integer sequences with interesting patterns arise in the analysis, owing to the number theoretic origin of the problem.

This page was built for publication: A Convex Maximization Problem: Discrete Case

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