Solutions of minimum time problem and minimum fuel problem for discrete linear admissible control systems
- 1 August 1978
- journal article
- research article
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 9 (8) , 849-855
- https://doi.org/10.1080/00207727808941743
Abstract
In this paper the minimum time problem and the minimum fuel problem for discrete linear admissible control systems arc formulated (is one linear programming problem with two different objective functions. It is found that the obtained problem is very similar to the dual form of the linear programming problem for the discrete linear L1 approximation problem. An efficient dual simplex algorithm for the latter problem is used with the necessary modification* to obtain the solution of either of the former problems. Numerical results show that the present, method compares favourably with other known methods.Keywords
This publication has 4 references indexed in Scilit:
- A simplex algorithm for on-line computation of time optimal controlsIEEE Transactions on Automatic Control, 1971
- Determination of reachable set for a linear discrete systemIEEE Transactions on Automatic Control, 1970
- A solution of the discrete minimum-time control problemJournal of Optimization Theory and Applications, 1970
- Optimization of discrete control systems through linear programmingJournal of the Franklin Institute, 1964