Editors Note: The first in a three-part introduction to Linear Feedback Shift Registers (LFSRs), this article is abstracted from the book Bebop to the Boolean Boogie (An Unconventional Guide to ...

The minimization of a convex function of variables subject to linear inequalities is discussed briefly in general terms. Dantzig's Simplex Method is extended to yield finite algorithms for minimizing ...

In this problem, the optimal path is one that maximizes the expected utility, with the utility function being piecewise-linear and concave. Such a utility function can be used to approximate nonlinear ...