Browsing by Subject "1968 Dissertation M148"
Now showing items 1-1 of 1
-
(Texas A&M University. Libraries, 1967)A convex programming algorithm for linear constraints is developed which essentially involves the solution of a sequence of subproblems of the original problem, each of which is formed by constructing the largest possible ...