A Convex Maximization Problem: Discrete Case

1999/12/05 by Steven Finch, Finch, Steven
Mathematics · #11A99 #11B37 #11B99 #11P99 #90C05 #90C25 #90C30 #90C90 #FOS: Mathematics #Optimization and Control (math.OC) #math.OC #msc:11A99 #msc:11B37 #msc:11B99 #msc:11P99 #msc:90C05 #msc:90C25 #msc:90C30 #msc:90C90

paper · pdf · doi:10.48550/arxiv.math/9912035

8 pages

arxiv created 1999/12/05 · arxiv updated 2009/11/30

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.

Related

• A Convex Maximization Problem: Continuous Case
• More on discrete convexity
• Optimality certificates for convex minimization and Helly numbers
• Finding a maximal element of a convex set through its characteristic cone: An application to finding a strictly complementary solution
• Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set