A numerical approach for optimal control model of the convex semi-infinite programming
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.
Main Author: | Hamid Rouhparvar |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University, Rasht Branch
2015-12-01
|
Series: | Iranian Journal of Optimization |
Subjects: | |
Online Access: | http://ijo.iaurasht.ac.ir/article_519141_4f0562b3637b4466757d2112b1645445.pdf |
Similar Items
-
A numerical approach for optimal control model of the convex semi-infinite programming
by: Hamid Rouhparvar
Published: (2015-07-01) -
A numerical approach for optimal control model of the convex semi-infinite programming
by: Hamid Rouhparvar
Published: (2015-10-01) -
On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints
by: Sy-Ming Guu, et al.
Published: (2017-11-01) -
Optimality and duality for nonsmooth semi-infinite E-convex multi-objective programming with support functions
by: Emam Tarek
Published: (2020-01-01) -
Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
by: Singh Yadvendra, et al.
Published: (2017-01-01)