Search
Search Results
##search.searchResults.foundPlural##
-
Further Developments in an Iterative Projection and Contraction Method for Linear Programming
34094 3385 Pages:350-364 -
Solution of Optimal Transportation Problems Using a Multigrid Linear Programming Approach
41947 4173 Pages:933-951 -
Linearly Convergent First-Order Algorithms for Semidefinite Programming
37742 2857 Pages:452-468 -
Solving a Class of Inverse QP Problems by a Smoothing Newton Method
35939 3412 Pages:787-801 -
The Primal-Dual Potential Reduction Algorithm for Positive Semi-Definite Programming
32240 3359 Pages:339-346 -
A DRS-Based Path-Following Algorithm for Linear Programming
4317 344 Pages:1141-1168 -
On an Efficient Implementation of the Face Algorithm for Linear Programming
36319 3831 Pages:335-354 -
Expected Number of Iterations of Interior-Point Algorithms for Linear Programming
33467 3826 Pages:93-100 -
A Scaled Central Path for Linear Programming
34165 3814 Pages:35-40 -
Primal Perturbation Simplex Algorithms for Linear Programming
31892 3651 Pages:587-596 -
Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming
46455 3896 Pages:866-888 -
Predictor-Corrector Algorithm for Convex Quadratic Programming with Upper Bounds
33610 3534 Pages:161-171 -
An Exact Solution to Linear Programming Using an Interior Point Method
32691 3770 Pages:264-271 -
Determination and Correction of an Inconsistent System of Linear Inequalities
32695 3289 Pages:211-217 -
A Multidimensional Filter SQP Algorithm for Nonlinear Programming
42123 2843 Pages:683-704 -
A Fast Simplex Algorithm for Linear Programming
34937 3624 Pages:837-847 -
A New Perturbation Simplex Algorithm for Linear Programming
33241 3646 Pages:233-242 -
QP-Free, Truncated Hybrid Methods for Large-Scale Nonlinear Constrained Optimization
32991 3793 Pages:36-54 -
A Modified Bisection Simplex Method for Linear Programming
32974 3373 Pages:249-255 -
A New Step-Size Skill for Solving a Class of Nonlinear Projection Equations
34005 3607 Pages:357-368 -
An Interior Point Method for Linear Programming
32976 3571 Pages:342-351