BYU-BYU-View: a wind communication interface

A simplex-type method for finding a local maximum of

A problem in the study of production smoothing leads to the problem of minimizing a linear form \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $L(x) = \sum^{N}_{i=1}c_{i}x_{i}$ \end{document} subject to constraints of the type x_i ≧ 0, \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $\sum^{k}_{i=1}x_{i}\geqq r_{k}$ \end{document}. A computational solution of this problem is given, using the methods of dynamic programming.

If fuel cells and fuel batteries attain their expected usefulness in the future, electrical and electronics engineers may some day be joined by a new kind of engineerߞthe electrochemical engineer. The fuel-cell problems this new engineer will have to ...