Search
Search Results
##search.searchResults.foundPlural##
-
Further Developments in an Iterative Projection and Contraction Method for Linear Programming
34198 3404 Pages:350-364 -
Solution of Optimal Transportation Problems Using a Multigrid Linear Programming Approach
42069 4214 Pages:933-951 -
Linearly Convergent First-Order Algorithms for Semidefinite Programming
37854 2892 Pages:452-468 -
Solving a Class of Inverse QP Problems by a Smoothing Newton Method
36041 3440 Pages:787-801 -
The Primal-Dual Potential Reduction Algorithm for Positive Semi-Definite Programming
32306 3382 Pages:339-346 -
A DRS-Based Path-Following Algorithm for Linear Programming
4794 417 Pages:1141-1168 -
On an Efficient Implementation of the Face Algorithm for Linear Programming
36424 3854 Pages:335-354 -
Expected Number of Iterations of Interior-Point Algorithms for Linear Programming
33523 3871 Pages:93-100 -
A Scaled Central Path for Linear Programming
34267 3864 Pages:35-40 -
Primal Perturbation Simplex Algorithms for Linear Programming
32000 3677 Pages:587-596 -
Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
46610 3969 Pages:866-888 -
Predictor-Corrector Algorithm for Convex Quadratic Programming with Upper Bounds
33709 3555 Pages:161-171 -
An Exact Solution to Linear Programming Using an Interior Point Method
32788 3792 Pages:264-271 -
Determination and Correction of an Inconsistent System of Linear Inequalities
32787 3305 Pages:211-217 -
A Multidimensional Filter SQP Algorithm for Nonlinear Programming
42243 2871 Pages:683-704 -
A Fast Simplex Algorithm for Linear Programming
35031 3657 Pages:837-847 -
A New Perturbation Simplex Algorithm for Linear Programming
33305 3665 Pages:233-242 -
QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization
33091 3834 Pages:36-54 -
A Modified Bisection Simplex Method for Linear Programming
33120 3396 Pages:249-255 -
A New Step-Size Skill for Solving a Class of Nonlinear Projection Equations
34093 3622 Pages:357-368 -
An Interior Point Method for Linear Programming
33081 3593 Pages:342-351