Key Laboratory of Computational Mathematics and Applications of Hebei Province

Shijiazhuang, China

Key Laboratory of Computational Mathematics and Applications of Hebei Province

Shijiazhuang, China

Time filter

Source Type

Zhang H.,Hebei University of Technology | Zhang H.,Hebei Normal University | Tao Y.,Hebei University of Technology | Zhang Z.,Hebei Normal University | Zhang Z.,Key Laboratory of Computational Mathematics and Applications of Hebei Province
Systems and Control Letters | Year: 2016

This paper considers the strong solvability of interval max-plus systems. The solvable entry and solvable interval are introduced to establish the necessary and sufficient condition for strong solvability of interval max-plus systems. It is proved that such a criterion is equivalent to the criterion proposed by Cechlárová and Cuninghame-Green. The interval strong solution of interval max-plus systems is described and the necessary and sufficient condition for uniquely strong solvability is given. The method of testing strong solvability of interval max-plus systems is constructive and leads to an effective algorithm. To illustrate our results, a workshop optimal control problem is addressed. © 2016 Elsevier B.V.

Loading Key Laboratory of Computational Mathematics and Applications of Hebei Province collaborators
Loading Key Laboratory of Computational Mathematics and Applications of Hebei Province collaborators