Welcome to the InfoSci Platform
Reference Hub1
Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem

Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem

Elias Munapo
Copyright: © 2021 |Pages: 16
ISBN13: 9781799839705|ISBN10: 1799839702|ISBN13 Softcover: 9781799850397|EISBN13: 9781799839712
DOI: 10.4018/978-1-7998-3970-5.ch003
Cite Chapter Cite Chapter

MLA

Munapo, Elias. "Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem." Research Advancements in Smart Technology, Optimization, and Renewable Energy, edited by Pandian Vasant, et al., IGI Global, 2021, pp. 37-52. https://doi.org/10.4018/978-1-7998-3970-5.ch003

APA

Munapo, E. (2021). Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem. In P. Vasant, G. Weber, & W. Punurai (Eds.), Research Advancements in Smart Technology, Optimization, and Renewable Energy (pp. 37-52). IGI Global. https://doi.org/10.4018/978-1-7998-3970-5.ch003

Chicago

Munapo, Elias. "Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem." In Research Advancements in Smart Technology, Optimization, and Renewable Energy, edited by Pandian Vasant, Gerhard Weber, and Wonsiri Punurai, 37-52. Hershey, PA: IGI Global, 2021. https://doi.org/10.4018/978-1-7998-3970-5.ch003

Export Reference

Mendeley
Favorite

Abstract

The chapter presents a new approach to improve the verification process of optimality for the general knapsack linear integer problem. The general knapsack linear integer problem is very difficult to solve. A solution for the general knapsack linear integer problem can be accurately estimated, but it can still be very difficult to verify optimality using the brach and bound related methods. In this chapter, a new objective function is generated that is also used as a more binding equality constraint. This generated equality constraint can be shown to significantly reduce the search region for the branch and bound-related algorithms. The verification process for optimality proposed in this chapter is easier than most of the available branch and bound-related approaches. In addition, the proposed approach is massively parallelizable allowing the use of the much needed independent parallel processing.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.