نتایج جستجو برای: network simplex algorithm
تعداد نتایج: 1330600 فیلتر نتایج به سال:
The multicommodityow probleminvolves simultaneouslyship-ping multiplecommoditiesthrough a single network so that the total amount of ow on each edge is no more than the capacity of the edge. This problem can be expressed as a large linear program, and most known algorithms for it, both theoretical and practical, are linear programming algorithms designed to take advantage of the structure of mu...
The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). One of the important steps of the simplex algorithm is applying an appropriate pivot rule to select the basis-entering variable corresponding to the maximum reduced cost. Unfortunat...
We describe a cutting plane algorithm for solving linear ordering problems. The algorithm uses a primal-dual interior point method to solve the rst few relaxations and then switches to a simplex method to solve the last few relaxations. The simplex method uses CPLEX 4.0. We compare the algorithm with one that uses only an interior point method and with one that uses only a simplex method. We so...
This study examines a multi-objective fuzzy simplex-genetic algorithm which was developed to predict bank legal customers financial performance. Prediction performance of the model was examined based on its ability to accurately identify credit default. Using available data from KESHVARZI bank over 2001-2006, debt ratio, operational ratio, and return on equity are selected as descriptive vari...
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extreme point, for solving a class of linear programs with countably infinite variables and constraints. Each iteration of this method can be implemented in finite time, while the solution values converge to the optimal valu...
فرآیند هیدروفرمینگ یکی از روش های نسبتاً نوین شکل دهی فلزات است که به مرور به یکی از روش های مهم شکل دهی و به ویژه شکل دهی لوله در صنعت تبدیل شده است. علت این امر مزایای گسترده این فرآیند در افزایش قابلیت های مطلوب قطعه از جمله افزایش استحکام، کاهش وزن، کاهش عملیات های ثانویه بر روی قطعه و دستیابی به تلورانس های ابعادی دقیقتر می باشد. با گسترش استفاده از المان محدود و توسعه مفاهیم مربوطه، استف...
By introducing quadratic penalty terms, a convex nonseparable quadratic network program can be reduced to an unconstrained optimization problem whose objective function is a piecewise quadratic and continuously differentiable function. A conjugate gradient method is applied to the reduced problem and its convergence is proved. The computation exploits the special network data structures origina...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید