A combined interactive approach for solving E-convex multiobjective nonlinear programming problem
From MaRDI portal
Recommendations
- An interactive reference direction algorithm for solving multi-objective convex nonlinear integer programming problems
- Norm-based approximation in E-convex multi-objective programming
- scientific article; zbMATH DE number 3878703
- Norm-based approximation in \(E\)-\([0,1]\) convex multi-objective programming
- Interactive reference direction approach using implicit parametrization for nonlinear multiobjective optimization
Cites work
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- Comparative studies in interactive multiple objective mathematical programming
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 4112406 (Why is no real title available?)
- scientific article; zbMATH DE number 956509 (Why is no real title available?)
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Optimality criteria in \(E\)-convex programming
- Some properties of semi-E-convex functions.
- Theory of multiobjective optimization
- Unified interactive multiple objective programming
- Unified Interactive Multiple Objective Programming: An Open Architecture For Accommodating New Procedures
Cited in
(6)- 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
- Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
- Higher-order (F, , , , d, E)-convexity in fractional programming
- Exponentially E-convex vector optimization problems
- Robust parametric \(\mathbb{E}_{\mathbb{R}}\)-Karush-Kuhn-Tucker optimality criteria for fractional interval-valued optimization problems
This page was built for publication: A combined interactive approach for solving E-convex multiobjective nonlinear programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716066)