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.

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.

in this paper, according to high load capacity and rather large workspace characteristics of cable driven robots (cdrs), maximum dynamic load carrying capacity (dlcc) between two given end points in the workspace along with optimal trajectory is obtained. in order to find dlcc of cdrs, joint actuator torque and workspace of the robot constraints concerning to non-negative tension in cables are ...

In this paper, we address the temporal knapsack problem (TKP), a generalization of classical problem, where selected items enter and leave at fixed dates. We model TKP with dynamic program exponential size, which is solved using method called Successive Sublimation Dynamic Programming (SSDP). This starts by relaxing set constraints from initial iteratively reintroduces them when needed. show th...