Year: 2019
Type: article
Abstract: 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.
Source: Mathematics
DOI: 10.3390/math7050435
Author: Hsien-Chung Wu
Institution: National Kaohsiung Normal University
Language: English
Field: Decision Sciences
Domain: Social Sciences
Open Access status: gold
Estimated APC paid: $1,216
OpenAlex ID: W2945707071
