Minimum-fuel control of linear discrete systems

In this paper an iterative procedure for determining a minimum-fuel control of a linear discrete system is suggested. The procedure is based on the simplex method from linear programming and requires a finite number of iterations. Necessary and sufficient conditions for uniqueness of the solution to...

Full description

Saved in:
Bibliographic Details
Published in:International journal of control 1976-02, Vol.23 (2), p.207-216
Main Author: KOLEV, L. V.
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper an iterative procedure for determining a minimum-fuel control of a linear discrete system is suggested. The procedure is based on the simplex method from linear programming and requires a finite number of iterations. Necessary and sufficient conditions for uniqueness of the solution to> the problem investigated are also established.
ISSN:0020-7179
1366-5820
DOI:10.1080/00207177608922153