Abstract
In this paper an iterative procedure for obtaining a minimum-fuel minimum-time control for a linear discrete system is suggested. The procedure suggested is based on the third form of the simplex method from linear programming and appears to be computationally more efficient than other known techniques.

This publication has 5 references indexed in Scilit: