k-th

说明：  在Bialas與Karwan的第 解演算法 [13] 則是搜尋限制式解域中的端點，並且歸類為已搜尋端點集合、未搜尋端點集合、可行解端點集合、非可行解端點集合，再從可行解端點集合中找出使高階目標值最佳的端點。(Bialas and Karwan in the first solution algorithm [13] is the search for solutions in the domain of endpoint constraints, and the endpoints are classified as a collection of search, not search a collection of endpoints, the endpoint set of feasible solutions, non-feasible solution side point set, then the endpoint from the set of feasible solutions in order to identify the best target endpoint.)