A Convex Maximization Problem: Discrete Case

Details A Convex Maximization Problem: Discrete Case A Convex Maximization Problem: Discrete Case

1999-12-05

arxiv.org/abs/math/9912035v1

Mathematics

Optimization and Control

8 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Convex Maximization Problem: Discrete Case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Convex Maximization Problem: Discrete Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Convex Maximization Problem: Discrete Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386047