Some characterization of -approximate solutions for multiobjective programming problems
From MaRDI portal
Publication:4648024
zbMATH Open1259.90125MaRDI QIDQ4648024FDOQ4648024
Authors: Kazunori Yokohama 
Publication date: 8 November 2012
Recommendations
- Epsilon approximate solutions for multiobjective programming problems
- On approximate efficiency in multiobjective programming
- ε-approximate solutions in multiobjective optimization
- On approximating weakly/properly efficient solutions in multi-objective programming
- scientific article; zbMATH DE number 6672028
Multi-objective and goal programming (90C29) Numerical methods based on nonlinear programming (49M37)
Cited In (8)
- Title not available (Why is that?)
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
- On approximating weakly/properly efficient solutions in multi-objective programming
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A new method in multiple objective programming study and its application in \(\varepsilon \)-Pareto solution and \(\varepsilon \)-Pareto saddle point
- On approximate efficiency in multiobjective programming
- Title not available (Why is that?)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
This page was built for publication: Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648024)
