本文讨论了一维空间中的非凸复盖问题。

In this paper, a nonconvex covering problem in one dimension is dis-cussed.

youdao

该模型中的资源分配问题是一个非凸的非线性优化问题。

The problem of resource allocation in this scheme is a non-convex non-linear optimization problem.

youdao

最后研究了广义集值变分包含问题与非凸规划之间的关系。

Finally, the relationships between generalized set-valued variational inclusion problems and non-convex programming are studied.

youdao