本文首先介绍了一般交叉规划，然后给出了一类特殊的交叉规划。
The article introduces a general interactive programming, then gives a special interactive programming.
并且通过把该交叉规划转化为特殊的凸二次双水平规划，给出这类交叉规划的最优性条件和求解算法。
Furthermore, it gives an optimum condition and a simple algorithm of the special interaction programming by changing it into a special convex quadratic bilevel programming.
在这个例子中，规划扑克起到了交叉检查的作用，防止对于用户故事范围的错误理解。
In this case, planning poker serves as a cross-check, preventing a gross misunderstanding about the scope of the user story.
应用推荐