A Neural Network Approach to Solve Semi-infinite Linear Programming Problems


Authors

Alireza Fakharzadeh - Department of Mathematics, Faculty of basic Sciences, Shiraz University of Technology, Shiraz, Iran. Zahra Alamdar - Department of Mathematics, Faculty of Basic Sciences, Shiraz University of Technology, Shiraz, Iran. Masoumeh Hosseinipour - Department of Mathematics, Faculty of Basic Sciences, Shiraz University of Technology, Shiraz, Iran.


Abstract

In this article, we present a new algorithm for solving Semi-Infinite Linear Programming (SILP) problems based on an artificial neural network concept. First the local reduction method for solving the SILP problems is introduced. Based on the local reduction method, the Karush-Kuhn-Tucker (KKT) conditions and gradient method are used to convert the SILP problem to an unconstrained optimization problem; then, a neural network model is constructed to solve it. Numerical example has been employed to indicate the accuracy of the new method.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

Alireza Fakharzadeh, Zahra Alamdar, Masoumeh Hosseinipour, A Neural Network Approach to Solve Semi-infinite Linear Programming Problems, Journal of Mathematics and Computer Science, 5 (2012), no. 3, 160 - 166

AMA Style

Fakharzadeh Alireza, Alamdar Zahra, Hosseinipour Masoumeh, A Neural Network Approach to Solve Semi-infinite Linear Programming Problems. J Math Comput SCI-JM. (2012); 5(3):160 - 166

Chicago/Turabian Style

Fakharzadeh, Alireza, Alamdar, Zahra, Hosseinipour, Masoumeh. "A Neural Network Approach to Solve Semi-infinite Linear Programming Problems." Journal of Mathematics and Computer Science, 5, no. 3 (2012): 160 - 166


Keywords


MSC


References