Abstract
Mathews [1897] has given a theorem for aggregating two diophantine equations with positive integer coefficients into a single equation that has the same solution set as its parents over the nonnegative integers. Building on this result,Elmaghraby andWig [1970] show how to shrink the inequality constraints of a bounded variable integer program to a single constraint equation. However, such applications are limited, as we show, by a greater than exponential growth in coefficient size as successive constraints are aggregated into one. To mitigate this situation, we give new theorems and implementation procedures that provide exponential order reductions in the coefficient growth attending the aggregation process.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
