Integrating reference point, Kuhn–Tucker conditions and neural network approach for multi-objective and multi-level programming problems

In this paper, a neural network approach is constructed to solve multi-objective programming problem (MOPP) and multi-level programming problem (MLPP). The main idea is to convert the MOPP and the MLPP into an equivalent convex optimization problem. A neural network approach is then constructed for...

Full description

Saved in:
Bibliographic Details
Published in:Opsearch 2017-12, Vol.54 (4), p.663-683
Main Authors: Rizk-Allah, R. M., Abo-Sinna, Mahmoud A.
Format: Article
Language:English
Subjects:
Application Article
Business and Management
Computer simulation
Convexity
Kuhn-Tucker method
Management
Mathematical programming
Mathematics
Multiple objective analysis
Neural networks
Operations research
Operations Research/Decision Theory
Optimization
Simulation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, a neural network approach is constructed to solve multi-objective programming problem (MOPP) and multi-level programming problem (MLPP). The main idea is to convert the MOPP and the MLPP into an equivalent convex optimization problem. A neural network approach is then constructed for solving the obtained convex programming problem. Based on employing Lyapunov theory, the proposed neural network approach is stable in the sense of Lyapunov and it is globally convergent to an exact optimal solution of the MOPP and the MLPP. The simulation results also demonstrate that the proposed neural network is feasible and efficient.
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-017-0299-4