Abstract
Two sets of numbers are generated to determine the feasibility and periodicity for an equality-constraint knapsack problem. By aid of the two sets, it is shown that for only a finite number of right hand side numbers the knapsack problem is hard. A novel method is given for solving such hard knapsack problems, of which the complexities of a main part does not depend on the number of variables involved, provided that the constraint coefficients are bounded. A method for representing all the optimal solutions of the knapsack problem for all right hand side numbers is further shown. A similar theory is also developed for an equality-constraint integer linear program with mixed signs in the constraint coefficients.
Sign-in/Register to access full text options 
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.
