scholarly journals Assignment model with multi-objective linear programming for allocating choice ranking using recurrent neural network

Author(s):  
Zahra Sadat Mirzazadeh ◽  
Javad Banihassan ◽  
Amin Mansoori

Classic linear assignment method is a multi-criteria decision-making approach in which criteria are weighted and each rank is assigned to a choice. In this study, to abandon the requirement of calculating the weight of criteria and use decision attributes prioritizing and also to be able to assign a rank to more than one choice, a multi-objective linear programming (MOLP) method is suggested. The objective function of MOLP is defined for each attribute and MOLP is solved based on absolute priority and comprehensive criteria methods. For solving the linear programming problems we apply a recurrent neural network (RNN). Indeed, the Lyapunov stability of the model is proved. Results of comparing the proposed method with TOPSIS, VICOR, and MOORA methods which are the most common multi-criteria decision schemes show that the proposed approach is more compatible with these methods.

2010 ◽  
Vol 22 (11) ◽  
pp. 2962-2978 ◽  
Author(s):  
Qingshan Liu ◽  
Jinde Cao ◽  
Guanrong Chen

In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.


2012 ◽  
Vol 3 (4) ◽  
pp. 1-6 ◽  
Author(s):  
M.Jayalakshmi M.Jayalakshmi ◽  
◽  
P.Pandian P.Pandian

Sign in / Sign up

Export Citation Format

Share Document