Scribd
Upload
22 views

Module 7: Integer Programming Learning Objectives

This document discusses the objectives of an integer programming module. It aims to teach techniques for solving optimization problems that require decision variables to have integer values, such as integer linear programming. The module explains integer programming and its relationship to linear programming. It also describes Gomory's cutting plane method for solving integer programs and how to generate Gomory constraints to solve all-integer and mixed integer linear programs using this technique.

Uploaded by

swapna44
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

Module 7: Integer Programming Learning Objectives

This document discusses the objectives of an integer programming module. It aims to teach techniques for solving optimization problems that require decision variables to have integer values, such as integer linear programming. The module explains integer programming and its relationship to linear programming. It also describes Gomory's cutting plane method for solving integer programs and how to generate Gomory constraints to solve all-integer and mixed integer linear programs using this technique.

Uploaded by

swapna44
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Optimization Methods: Integer Programming Module 7: Integer Programming Learning Objectives

- Learning Objectives

The previous modules discussed about the optimization methods using linear programming and dynamic programming techniques with almost no limit in the values taken by decision variables. But many practical problems require the constraint of integrality in decision variable values. This can be solved using Integer programming which is the main objective of this module. The module gives a description of Integer programming, with emphasis on Integer Linear Programming (ILP), its relation with linear programming and the various types of integer programming,. Among the various techniques for solving ILP, a well known method Gomorys cutting plane method is explained. The concept of this method is explained graphically to give the reader a better understanding. The generation of Gomory constraints are also well explained for all- integer LP and also mixed ILP, which will in turn help the reader to solve any type of integer programming. At the end of the module the reader will be able to 1. Formulate the ILP. 2. Generate Gomory constraints. 3. Solve all-integer LP by Gomory cutting plane method. 4. Solve mixed Integer LP by Gomory cutting plane method.

D Nagesh Kumar, IISc, Bangalore

M7LO

You might also like