CFP last date
16 December 2024
Call for Paper
January Edition
IJAIS solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 16 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Ordered Frequent Itemsets Matrix Based On Fp-Tree Structure And Apriori Algorithm

Abdulkader M. Al-Badani Abdualmajed A. Al-Khulaidi
Random Articles
Reseach Article

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

by Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, Coskun Guler
journal cover thumbnail

International Journal of Applied Information Systems
Foundation of Computer Science (FCS), NY, USA
Volume 12 - Number 25
Year of Publication: 2019
Authors: Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, Coskun Guler
10.5120/ijais2019451826

Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, Coskun Guler . An Alternative Algorithm for Solving Pure Integer Linear Programming Problems Having Two Variables. International Journal of Applied Information Systems. 12, 25 ( November 2019), 6-9. DOI=10.5120/ijais2019451826

@article{ 10.5120/ijais2019451826,
author = { Kadriye Simsek Alan, Inci Albayrak, Mustafa Sivri, 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 },
numpages = {9},
url = { https://www.ijais.org/archives/volume12/number25/1069-2019451826/ },
doi = { 10.5120/ijais2019451826 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2023-07-05T19:10:04.697830+05:30
%A Kadriye Simsek Alan
%A Inci Albayrak
%A Mustafa Sivri
%A Coskun Guler
%T An Alternative Algorithm for Solving Pure Integer Linear Programming Problems Having Two Variables
%J International Journal of Applied Information Systems
%@ 2249-0868
%V 12
%N 25
%P 6-9
%D 2019
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  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.
Index Terms

Computer Science
Information Sciences

Keywords

Linear integer programming Linear Diophantine equations optimal hyperplane

Powered by PhDFocusTM