讨论带有多个反凸约束的线性规划。
Linear programs with several reverse convex constraints are discussed.
根据凸分析理论和单纯形法原理，提出了指派问题的一个线性规划解法。
According to the raised analysis theory and the simplex method principle, proposed an assignment problem linear programming solution.
对束方法的研究涉及凸分析，线性和非线性规划，非光滑分析等数学分支。
Researches on bundle methods touch upon such mathematical branches as convex analysis, nonlinear programming and nonsmooth analysis.
应用推荐