Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
From MaRDI portal
Publication:2840251
DOI10.1134/S0965542513020061zbMath1274.90344MaRDI QIDQ2840251
Mikhail A. Posypkin, Yuri G. Evtushenko
Publication date: 17 July 2013
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Related Items (23)
Decomposition methods for polyhedral approximation of the Edgeworth-Pareto hull ⋮ On upper approximations of Pareto fronts ⋮ Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem ⋮ Approximation of the effective hull of a nonconvex multidimensional set given by a nonlinear mapping ⋮ New external estimate for the reachable set of a nonlinear multistep dynamic system ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ Study of hybrid methods for approximating the Edgeworth-Pareto hull in nonlinear multicriteria optimization problems ⋮ A new trisection method for solving Lipschitz bi-objective optimization problems ⋮ Decomposition of the problem of approximating the Edgeworth-Pareto hull ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ Launch pad method in multiextremal multiobjective optimization problems ⋮ Mathematical modeling of the Wuhan COVID-2019 epidemic and inverse problems ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ Numerical methods for estimating approximate solutions of multicriteria optimization problems ⋮ Method for constructing optimal dark coverings ⋮ Approximating a solution set of nonlinear inequalities ⋮ Nonlinear biobjective optimization: improving the upper envelope using feasible line segments ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ Branch and probability bound methods in multi-objective optimization ⋮ Simple efficient hybridization of classic global optimization and genetic algorithms for multiobjective optimization ⋮ A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization ⋮ Effective hull of a set and its approximation ⋮ Interactive Multiple Criteria Decision Making for Large-Scale Multi-Objective Optimization Problems
This page was built for publication: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
