Numerical Method for Solving the Robust Continuous-Time Linear Programming Problems

A robust continuous-time linear programming problem is formulated and solved numerically in this paper. The data occurring in the continuous-time linear programming problem are assumed to be uncertain. In this paper, the uncertainty is treated by following the concept of robust optimization, which h...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Mathematics (Basel) Ročník 7; číslo 5; s. 435
Hlavný autor: Wu, Hsien-Chung
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.05.2019
Predmet:
Algorithms
approximate solutions
continuous-time linear programming problems
Linear programming
Mathematical functions
Numerical analysis
Numerical methods
Optimization
robust optimization
Robustness (mathematics)
ϵ-optimal solutions
ISSN:2227-7390, 2227-7390
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A robust continuous-time linear programming problem is formulated and solved numerically in this paper. The data occurring in the continuous-time linear programming problem are assumed to be uncertain. In this paper, the uncertainty is treated by following the concept of robust optimization, which has been extensively studied recently. We introduce the robust counterpart of the continuous-time linear programming problem. In order to solve this robust counterpart, a discretization problem is formulated and solved to obtain the ϵ -optimal solution. The important contribution of this paper is to locate the error bound between the optimal solution and ϵ -optimal solution.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2227-7390
2227-7390
DOI:10.3390/math7050435