PEACPocket: a technological demonstrator for future multimedia smart card

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.

applied to the problem of unit sizing in a hybrid power system such that demand of residential area is met. Optimal sizing of two systems is considered. In the system No.1, the produced power is delivered to the load and the hydrogen produced by the ...