basic feasible solution

基本解释

The properties of the basic feasible solution of a linear programming problem are studied.
讨论一般信息选择问题中的属性、条件和可行解的关系。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
Finally, basic ideas and methods are presented about inquiry and statistics with this proposed solution, project practice proved this way is truly feasible, is a good method for multi - granularity.
最后给出利用层次编码方案解决不同粒度级别数据查询统计的基本思路和方法，结合项目实践证明该方案确实可行，是解决多重粒度级别的好方法。