Google scholar arxiv informatics ads IJAIS publications are indexed with Google Scholar, NASA ADS, Informatics et. al.

Call for Paper


June Edition 2021

International Journal of Applied Information Systems solicits high quality original research papers for the June 2021 Edition of the journal. The last date of research paper submission is May 15, 2021.

An Alternative Algorithm for Solving Pure Integer Linear Programming Problems Having Two Variables

Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, Coskun Guler in Algorithms

International Journal of Applied Information Systems
Year of Publication: 2019
Publisher: Foundation of Computer Science (FCS), NY, USA
Authors:Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, Coskun Guler
Download full text
  1. Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri and Coskun Guler. An Alternative Algorithm for Solving Pure Integer Linear Programming Problems Having Two Variables. International Journal of Applied Information Systems 12(25):6-9, November 2019. URL, DOI BibTeX

    	author = "Kadriye Simsek Alan and Inci Albayrak and Mustafa Sivri and Coskun Guler",
    	title = "An Alternative Algorithm for Solving Pure Integer Linear Programming Problems Having Two Variables",
    	journal = "International Journal of Applied Information Systems",
    	issue_date = "November, 2019",
    	volume = 12,
    	number = 25,
    	month = "November",
    	year = 2019,
    	issn = "2249-0868",
    	pages = "6-9",
    	url = "",
    	doi = "10.5120/ijais2019451826",
    	publisher = "Foundation of Computer Science (FCS), NY, USA",
    	address = "New York, USA"


An alternative algorithm is proposed, based on parametrization for solving a special class of integer linear programming (ILP) problems when the objective function is linear and the constraints are in the form of linear inequality. Although there are popular methods in the literature having widespread impact they are known to have some difficulties in terms of computation. To overcome these difficulties, a parameter-based algorithm that could be applied reliably and easily to (ILP) problems with two variables and no restriction on the constraints is proposed. The flow of the algorithm provides a set constructed by variable values that depend on the parameter. Thus, the solution satisfying the constraints can be selected easily from this set. The proposed algorithm is remarkable in that it can be applied easily even when the number of restrictions increases.


  1. Schrijver, A. 1986. Theory of Linear and Integer Programming. John Wiley & Sons Ltd .
  2. Joseph, A. 1995. Parametric formulation of the general integer linear programming problem. Computers & operations research, 22(9), 883-892.
  3. Pandian, P., Jayalakshmi, M. 2012. A New Approach for solving a Class of Pure Integer Linear Programming Problems. Journal of Advanced Engineering Technology, 3, 248-251.
  4. Tsai, J. F., Lin, M. H., Hu, Y. C. 2008. Finding multiple solutions to general integer linear programs. European Journal of Operational Research, 184(2), 802-809.
  5. Mohamad, N. H., Said, F. (2013). Integer linear programming approach to scheduling toll booth collectors problem. Indian Journal of Science and Technology, 6(5), 4416-4421.
  6. Genova, K., Guliashki, V.2011. Linear integer programming methods and approaches–a survey. Journal of Cybernetics and Information Technologies, 11(1).
  7. Hossain, M. I., Hasan, M. B. A Decomposition Technique For Solving Integer Programming Problems. GANIT: Journal of Bangladesh Mathematical Society, 33, 1-11.
  8. Shinto, K. G., Sushama, C. M. 2013. An Algorithm for Solving Integer Linear Programming Problems. International Journal of Research in Engineering and Technology, 37-47.
  9. Chen, D. S., Batson, R. G., & Dang, Y. 2011. Applied integer programming: modeling and solution. John Wiley & Sons.
  10. Bertsimas, D., Perakis, G., Tayur, S. 2000. A new algebraic geometry algorithm for integer programming. Management Science, 46(7), 999-1008.
  11. Tantawy, S. F. 2014. A new procedure for solving integer linear programming problems. Arabian Journal for Science and Engineering, 39(6), 5265-5269.
  12. Dang, C., Ye, Y. 2015. A fixed point iterative approach to integer programming and its distributed computation. Fixed Point Theory and Applications, (1), 182.
  13. Pedroso, J. P. 2002. An evolutionary solver for pure integer linear programming. International Transactions in Operational Research, 9(3), 337-352.


Linear integer programming, Linear Diophantine equations, optimal hyperplane