A Convex Maximization Problem: Discrete Case
最优化与控制
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/9912035,
title = {A Convex Maximization Problem: Discrete Case},
author = {Steven Finch},
journal= {arXiv preprint arXiv:math/9912035},
year = {2007}
}
备注
8 pages