in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

nowadays, due to inherent complexity of real optimization problems, it has always been a challenging issue to develop a solution algorithm to these problems. single row facility layout problem (srflp) is a np-hard problem of arranging a number of rectangular facilities with varying length on one side of a straight line with aim of minimizing the weighted sum of the distance between all facility...

due to project evaluation complexity and resource constraints, the project portfolio optimization is numerous decision making challenges. hence, many researches have been done to introduce model and methods for portfolio optimization. but most of them have not considered the interaction between projects. considering the interactions between projects increase complexity of portfolio optimization...

despite the growing use of evolutionary multi-objective optimization algorithms in different categories of science, these algorithms as a powerful tool in portfolio optimization and specially solving multi-objective portfolio optimization problem is still in its early stages. in this paper, moeas have been used for solving multi-objective portfolio optimization problem in tehran stock market. f...

in this paper, we introduce a model  to optimization of milk run system that is one of vrp problem with time window and uncertainty in inventory. this approach led to the routes with minimum cost of transportation while satisfying all inventory in a given bounded set of uncertainty .the problem is formulated as a robust optimization problem. since the resulted problem illustrates that grows up ...

in this paper, according to high load capacity and rather large workspace characteristics of cable driven robots (cdrs), maximum dynamic load carrying capacity (dlcc) between two given end points in the workspace along with optimal trajectory is obtained. in order to find dlcc of cdrs, joint actuator torque and workspace of the robot constraints concerning to non-negative tension in cables are ...