basic feasible solution

基本解釋

The properties of the basic feasible solution of a linear programming problem are studied.
討論一般信息選擇問(wèn)題中的屬性、條件和可行解的關(guān)系。
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.
此算法的基本思想是在規(guī)劃問(wèn)題的可行域中由所建的一個(gè)切割面到另一個(gè)切割面的不斷推進(jìn)來(lái)求取最優(yōu)的。
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.
最后給出利用層次編碼方案解決不同粒度級(jí)別數(shù)據(jù)查詢統(tǒng)計(jì)的基本思路和方法，結(jié)合項(xiàng)目實(shí)踐證明該方案確實(shí) 可行，是解決多重粒度級(jí)別的好方法。