First, the main procedures and the distinctive features of the most-obtuse-angle (MOA) row or column pivot rules are introduced for achieving primal or dual feasibility in linear programming.
首先回顾了采用最钝角行、列主元规则求解线性规画问题的原始、对偶可行解的主要过程,阐述了其与众不同的特性。
After demonstrating the feasibility of using the dual algorithm for general linear programming to solve this model, we get an effective algorithm.
通过论证用一般线性规划的对偶算法求解本模型的可行性,使得该模型的求解问题迎刃而解。
Objective To investigate the feasibility of virtual non-enhanced images in evaluating the spontaneous subarachnoid hemorrhage (SAH) by dual-energy computed tomography angiography.
目的 探讨虚拟平扫技术在头部扫描应用的可行性,及对评价自发性蛛网膜下腔出血的应用价值。
应用推荐