Integer Solutions to Box Optimization Problems

Authors

Vincent E. Coll Jr., Lehigh UniversityFollow
Jeremy Davis, Georgia Southern UniversityFollow
Martin Hall, Georgia Southern UniversityFollow
Colton Magnant, Georgia Southern UniversityFollow
James Stankewicz, Wesleyan University
Hua Wang, Georgia Southern UniversityFollow

Document Type

Article

Publication Date

5-2014

Publication Title

The College Mathematics Journal

DOI

10.4169/college.math.j.45.3.180

ISSN

1931-1346

Abstract

Two approaches contribute to the problem of finding integer side-lengths for open rectangular and polygonal boxes that optimize volume. One method adapts Pythagorean triples to an ellipse, while the other is based on counting factorizations.

Recommended Citation

Coll, Vincent E. Jr., Jeremy Davis, Martin Hall, Colton Magnant, James Stankewicz, Hua Wang. 2014. "Integer Solutions to Box Optimization Problems." The College Mathematics Journal, 45 (3): 180-190. doi: 10.4169/college.math.j.45.3.180
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/303