IEOM Index

1st African International Conference on Industrial Engineering and Operations Management

Step Algorithm to solve positive-integer type-linear programming problem with two variables and n linear constraints

Monal Vaishnani

Publisher: IEOM Society International

3 Views

1 Downloads

Track: Operations Research

In this paper, Step algorithm to solve positive integer type linear programming problems with two variables and n linear constraints is proposed. Classical methods to solve integer programming problems are branch and bound method and Gomory’s cutting plane algorithm. Manual solution by both these methods is tedious and tiring. Moreover to get multiple optima through branch and bond method, it is required to select different branch and need to solve for that particular branch. While in Gomory’s cutting plane algorithm, it is required to solve the problem again with different sets of iterations to have multi optima. Disadvantages of branch and bond method and Gomory’s cutting plane method give motivation to develop Step algorithm. Proposed method i.e. step algorithm works on the principle that in linear programming problem optimum solution always lies on the boundary of feasible region in maximization as well as in minimization problem. Furthermore step algorithm is less complex and can give multi optima solution in one go. To test the effectiveness of step algorithm few instances of integer programming problem with two variables are experimented. Obtained results prove that step algorithm is more efficient, easy and less time consuming.

Published in: 1st African International Conference on Industrial Engineering and Operations Management, Johannesburg, South Africa

Publisher: IEOM Society International
Date of Conference: October 30 -1 , 2018

ISBN: 978-1-5323-5947-7
ISSN/E-ISSN: 2169-8767