This paper describes a method to arrive at a feasible solution which can not be found in the linearly approximated constrained domain and a process which would reduce the number of finite element ...

We present a method to obtain sharp lower and upper bounds for the probability that at least one out of a number of events in an arbitrary probability space will occur. The input data are some of the ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.