SOLVING LINEAR SEMI-INFINITE PROGRAMMING PROBLEMS USING RECURRENT NEURAL NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MALEK A.; AHMADI G.; ALIZAMINI S.M.M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS Year:2016 | Volume:1 | Issue:1 Page(s): 55-67

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

685

Download:

153

Cites:

Information Journal Paper

Title

SOLVING LINEAR SEMI-INFINITE PROGRAMMING PROBLEMS USING RECURRENT NEURAL NETWORKS

Author(s)

MALEK A. | AHMADI G. | ALIZAMINI S.M.M. | Issue Writer Certificate

Keywords

LINEAR SEMI-INFINITE PROGRAMMING

RECURRENT NEURAL NETWORK

DYNAMICAL SYSTEM

DISCRETIZATION

LINEAR PROGRAMMING

Abstract

LINEAR SEMI-INFINITE PROGRAMMING problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a DISCRETIZATION method and a neural network method. By a simple DISCRETIZATION of the infinite constraints, we convert the LINEAR SEMI-INFINITE PROGRAMMING problem into LINEAR PROGRAMMING problem. Then, we use a RECURRENT NEURAL NETWORK model, with a simple structure based on a DYNAMICAL SYSTEM to solve this problem.The portfolio selection problem and some other numerical examples are solved to evaluate the effectiveness of the presented model.

Cites

No record.

References

No record.

Cite

APA: Copy

MALEK, A., AHMADI, G., & ALIZAMINI, S.M.M.. (2016). SOLVING LINEAR SEMI-INFINITE PROGRAMMING PROBLEMS USING RECURRENT NEURAL NETWORKS. CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS, 1(1 ), 55-67. SID. https://sid.ir/paper/267466/en

Vancouver: Copy

MALEK A., AHMADI G., ALIZAMINI S.M.M.. SOLVING LINEAR SEMI-INFINITE PROGRAMMING PROBLEMS USING RECURRENT NEURAL NETWORKS. CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS[Internet]. 2016;1(1 ):55-67. Available from: https://sid.ir/paper/267466/en

IEEE: Copy

A. MALEK, G. AHMADI, and S.M.M. ALIZAMINI, “SOLVING LINEAR SEMI-INFINITE PROGRAMMING PROBLEMS USING RECURRENT NEURAL NETWORKS,” CONTROL AND OPTIMIZATION IN APPLIED MATHEMATICS, vol. 1, no. 1 , pp. 55–67, 2016, [Online]. Available: https://sid.ir/paper/267466/en

Related Journal Papers