Some characterization of -approximate solutions for multiobjective programming problems
From MaRDI portal
(Redirected from Some characterization of -approximate solutions for multiobjective programming problems)
Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
Some characterization of \(\varepsilon\)-approximate solutions for multiobjective programming problems
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
Cited in
(9)- Epsilon approximate solutions for multiobjective programming problems
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- A new method in multiple objective programming study and its application in -Pareto solution and -Pareto saddle point
- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- On approximating weakly/properly efficient solutions in multi-objective programming
- scientific article; zbMATH DE number 1076403 (Why is no real title available?)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- On approximate efficiency in multiobjective programming
- Generalized -quasi-solutions in multiobjective optimization problems: existence results and optimality conditions
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)
