A combined interactive approach for solving E-convex multiobjective nonlinear programming problem

DOI10.1016/j.amc.2010.12.086zbMath1221.65147OpenAlexW2072049520MaRDI QIDQ716066

H. G. Gomaa, Adel A. Megahed, Abou-Zaid H. El-Banna, Ebrahim A. Youness

Publication date: 19 April 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.12.086

zbMATH Keywords

reference point methodPareto solutioninteractive approach\(E\)-convex multiobjective nonlinear programming problemsreference direction methodTchebycheff methodtrade off method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Related Items (4)

Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function ⋮ Unnamed Item ⋮ Second order \((F,\alpha ,\rho ,d,E)\)-convex function and the duality problem ⋮ Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Theory of multiobjective optimization
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Comparative studies in interactive multiple objective mathematical programming
• Unified interactive multiple objective programming
• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• Some properties of semi-\(E\)-convex functions.
• Optimality criteria in \(E\)-convex programming
• Unified Interactive Multiple Objective Programming: An Open Architecture For Accommodating New Procedures
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department

This page was built for publication: A combined interactive approach for solving E-convex multiobjective nonlinear programming problem