We present generalizations of simplex type algorithms generating two paths to the optimal solution. A distinguished charcteristic of the algorithm is the fact that one of the paths is not of simplex type. As a result the algorithms, avoiding the movement from one vertex to an adjacent one, can move from one arbitrary boundary point to another.

This paper deals with the state feedback control for linear systems in presence of delay using a direct numerical design methodology. The algorithm iteratively searches solution space controller parameters to find proper gain that guarantees delay-independent stability closed-loop system. divides some simplexes, selects one simplex and evaluates two checking methods on this simplex. first metho...