A potential reduction algorithm is proposed for optimization of a convex function subject to linear constraints. At each step of the algorithm,a system of linea
Let f∈C[0,1],and Bn(f,x) be the a-th Bernstein polynomial associated with function f.ln 1967,the limit of iterates for B.(f,x) was given by Kelisky and Rivlin.
In this paper exhaustive-service priority-M/G/1 queueing systems with multiple vacations, single vacation and setup times are studied under the nonpreemptive an