The solution of optimization problems is essential for the design and control of technical systems. The optimization problem arising in practice has a high dimension, nonlinear criteria, and constraints. There are a lot of continuous optimization tasks for testing and research of optimization algorithms performance. These tasks have a convex range of acceptable values limited to a specified range for each parameter. The problem of generating test multidimensional continuous optimization tasks with nonlinear constraints and splitting the feasible region is considered. A method was proposed for splitting the feasible region by separate domains using the multidimensional grid of forbidden solutions. As a result, the problem acquires properties closer to optimizing technical systems with complex constraints. The method allows creating an unlimited number of test optimization problems, which can be used to research and develop optimization algorithms. The method is simple to implement, and the impact on the computational complexity of tasks is insignificant. Research has been carried out on four widely used continuous single-objective optimization test functions, with the Genetic algorithm and the Particle Swarm Optimization algorithm. It is shown that the proposed method has an influence on the process of solving multidimensional continuous optimization problems by population algorithms and on the dependence of the accuracy of the algorithm on its heuristic coefficients.