the control of fluidized-bed operations processes is still one of the major areas of research due to the complexity of the process and the inherent nonlinearity and varying dynamics involved in its operation. there are varieties of problems in chemical engineering that can be formulated as nonlinear programming (nlps). the quality of the developed solution significantly affects the performance ...

A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...

Geometric programming is a mathematical technique, which has been developed for nonlinear optimization problems. This technique is based on the dual program with linear constraints. Determination of species concentrations in chemical equilibrium conditions is one of its applications in chemistry and chemical engineering fields. In this paper, the principles of geometric programming and its comp...

This paper presents a new algorithm for solving mixed integer nonlinear programming problems. The algorithm uses a branch and bound strategy where a nonlinear programming problem is solved in each integer node of the tree. The nonlinear programming problems, at each integer node of the tree, are not solved to optimality, rather one iteration step is taken at each node and then linearizations of...

One of the primary concerns in any system design problem is to prepare a highly reliable system with minimum cost. One way to increase the reliability of systems is to use redundancy in different forms such as active or standby. In this paper, a new nonlinear multi- objective integer programming model with the choice of redundancy strategy and component type is developed where standby strategy ...

Dynamic programming is one of the methods which utilize special structures of large-scale mathematical programming problems. Conventional dynamic programming, however, can hardly solve mathematical programming problems with many constraints. This paper proposes differential dynamic programming algorithms for solving largescale nonlinear programming problems with many constraints and proves thei...