eBook - ePub
Linear Integer Programming
Theory, Applications, Recent Developments
- 200 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
About this book
This book presents the state-of-the-art methods in Linear Integer Programming, including some new algorithms and heuristic methods developed by the authors in recent years. Topics as Characteristic equation (CE), application of CE to bi-objective and multi-objective problems, Binary integer problems, Mixed-integer models, Knapsack models, Complexity reduction, Feasible-space reduction, Random search, Connected graph are also treated.
Frequently asked questions
Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Linear Integer Programming by Elias Munapo,Santosh Kumar in PDF and/or ePUB format, as well as other popular books in Computer Science & IT Industry. We have over one million books available in our catalogue for you to explore.
Information
Chapter 1 Segment search approach for the general linear integer model
Abstract
This chapter presents a segment-search approach for the general linear integer problem. In this approach the feasible region is divided into segments and searched for the optimal solution. The segments are searched in their ascending or descending order depending on the nature of the problem and a solution feasible in the kth segment is also optimal to the whole problem. This approach has the strength that large numbers of sub-problems that usually result in large linear problems can now be managed easily in this way.
Keywords: Linear integer problem, Sub-problems, Segment-search, Feasible region, Variable limits,
1.0 Introduction
The general linear integer programming model (LIP) is one of the most difficult class of problems in combinatorial optimization and is in the NP-complete class of hard problems. This is a linear programming problem in which variables are restricted to integer values. There are several techniques that are available that can be used to solve...
Table of contents
- Title Page
- Copyright
- Contents
- Acknowledgements
- About the authors
- Chapter 1 Segment search approach for the general linear integer model
- Chapter 2 Improved solution method for the 0-1 GAP model
- Chapter 3 A search for an optimal integer solution over the integer polyhedron – Two iterative approaches
- Chapter 4 Use of variable sum limits to solve the knapsack problem
- Chapter 5 The characteristic equation for linear integer programs
- Chapter 6 Random search method for integer programming
- Chapter 7 Some special linear integer models and related problems
- Chapter 8 The travelling salesman problem: Sub-tour elimination approaches and algorithms
- Index
- De Gruyter Series on the Applications of Mathematics in Engineering and Information Sciences