A Convex Maximization Problem: Discrete Case
| dc.creator | Finch, Steven | |
| dc.date | 1999-12-05 | |
| dc.date.accessioned | 2026-07-07T05:32:07Z | |
| dc.date.available | 2026-07-07T05:32:07Z | |
| dc.description | 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. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/math/9912035 | |
| dc.identifier | http://arxiv.org/abs/math/9912035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/79545 | |
| dc.subject | Optimization and Control | |
| dc.subject | 90C05; 90C25; 90C30; 90C90; 11A99; 11B37; 11B99; 11P99 | |
| dc.title | A Convex Maximization Problem: Discrete Case | |
| dc.type | text |