Solutions of minimum time problem and minimum fuel problem for discrete linear admissible control systems

Download
  1. Get@NRC: Solutions of minimum time problem and minimum fuel problem for discrete linear admissible control systems (Opens in a new window)
DOIResolve DOI: http://doi.org/10.1080/00207727808941743
AuthorSearch for:
TypeArticle
Journal titleInternational Journal of Systems Science
ISSN0020-7721
Volume9
Issue8
Pages849855; # of pages: 7
AbstractIn 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.
Publication date
LanguageEnglish
AffiliationNational Research Council Canada
Peer reviewedYes
NRC number17195
NPARC number21273631
Export citationExport as RIS
Report a correctionReport a correction
Record identifierb3e89d23-c718-4a52-bfcb-af555bb886c1
Record created2015-01-16
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)