Bibliography for Linear Programming

unabridged

 

  1. Enumeration of All Possibly Optimal Vertices with Possible Optimality Degrees in Linear Programming Problems with a Possibilistic Objective Function
    Masahiro Inuiguchi
    Fuzzy Optimization and Decision Making, December 2004, vol. 3, no. 4, pp. 311-326(16), Ingenta.  
  2. Validated Infeasible Interior-Point Predictor--Corrector Methods for Linear Programming: SCAN'2002 International Conference (Guest Editors: René Alt and Jean-Luc Lamotte)
    Ismail I. Idriss; Wolfgang V. Walter
    Numerical Algorithms, December 2004, vol. 37, no. 1-4, pp. 177-185(9), Ingenta.   
  3. A Dual Projective Pivot Algorithm for Linear Programming
    Ping-Qi Pan
    Computational Optimization and Applications, December 2004, vol. 29, no. 3, pp. 333-346(14), Ingenta.   
  4. On Properties of Several Refinements of Optimal Solutions in Linear Programming
    A. Estévez-Fernández; M.G. Fiestras-Janeiro
    Journal of Optimization Theory and Applications, July 2004, vol. 122, no. 1, pp. 41-62(22), Ingenta.   
  5. Fuzzy Linear Programming with Interactive Uncertain Parameters
    Inuiguchi M.; Tanino T.
    Reliable Computing, 2004, vol. 10, no. 5, pp. 357-367(11), Ingenta.   
  6. A Newton Method for Linear Programming
    Mangasarian O.L.
    Journal of Optimization Theory and Applications, April 2004, vol. 121, no. 1, pp. 1-18(18), Ingenta.   
  7. Properties of the Central Points in Linear Programming Problems: Theory and Practice in Optimization. Guest Editors: José Mario Martínez and Jin Yun Yuan
    Gonzaga C.C.; Cardia M.
    Numerical Algorithms, April 2004, vol. 35, no. 2-4, pp. 185-204(20), Ingenta.   
  8. A linear programming approach for linear multi-level programming problems
    Sinha, S.B.; Sinha, S.
    Journal of the Operational Research Society, v 55, n 3, March, 2004, p 312-316, Compendex.
  9. The linear programming approach to approximate dynamic programming
    De Farias, D.P.; Van Roy, B.
    Operations Research, v 51, n 6, November/December, 2003, p 850-865, Compendex.
  10. An Infeasible Simplex Algorithm for Linear Programming
    Gao, P.-w.; Fan, G.-b.
    Journal- Jishou University Natural Science, 2003, vol. 24, no. 3, pp. 32-36, Ingenta.  
  11. A new simplex-like algorithm for linear programming.  
    Li, Wei
    Math. Theory Appl. (Changsha)  23  (2003),  no. 3, 118--122, MathSciNet.  
  12. A Scalable Parallel Algorithm of Linear Programming
    Li, Q.-h.; Li, K.-l.; Wang, D.-q.
    Minimicro Systems, 2003, vol. 24, no. 9, pp. 1718-1721, Ingenta.  
  13. Teaching the Concepts of the Simplex Algorithm in Linear Programming with MAPLE  
    Fox; West; Gower
    Computers in Education Journal, 2002, vol. 12, no. 4, pp. 49-56, Ingenta.  
  14. Dual Basic Line Algorithm for Linear Programming Problems
    Guozhen, R.; Yangjin, C.; Shushang, Z.
    Mathematica Numerica Sinica, 2002, vol. 24, no. 3, pp. 257-264, Ingenta.  
  15. On the equivalence of the simplex methods and a multiplier-alike method for linear programming.  
    Chang, T. S.; Adachi, J.; Wang, X.; Chen, T. R.
    J. Optim. Theory Appl.  113  (2002),  no. 3, 487--512, MathSciNet.  
  16. LPAKO: A Simplex-based Linear Programming Program
    Lim S.; Park S.
    Optimization Methods and Software, 1 January 2002, vol. 17, no. 4, pp. 717-745(29), Ingenta.   
  17. A new simplex algorithm for fuzzy linear programming. (Chinese)  
    Gao, Pei Wang  
    Mohu Xitong yu Shuxue  16  (2002),  no. 3, 64--68, MathSciNet.  
  18. Sharpening of a solution of a linear programming problem on iterations of the simplex method. (Russian)  
    Stanevichyus, A.-I. A.; Shklyar, P. È.
    Algebra and linear optimization (Russian) (Ekaterinburg, 2002),  306--308, Ross. Akad. Nauk Ural. Otdel., Inst. Mat. Mekh., Ekaterinburg, 2002, MathSciNet.  
  19. A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming
    Kuno, T.
    Computational Optimization and Applications, 2001, vol. 20, no. 2, pp. 119-136, Ingenta.  
  20. Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming
    Castillo, I.; Barnes, E. R.
    Siam Journal of Optimization, 2001, vol. 11, no. 3, pp. 781-795, Ingenta.  
  21. An algorithm for generalized fuzzy binary linear programming problems
    Yu, C. S.; Li, H. L.
    European Journal of Operational Research, 2001, vol. 133, no. ER3, pp. 496-511, Ingenta.  
  22. An efficient approach integrating genetic algorithm, linear programming, and ordinal optimization for linear mixed-integer programming problems
    Luo, Yuh-Chyun; Chen, Chun-Hung; Guignard, Monique  
    International Journal of Smart Engineering System Design, v 3, n 4, 2001, p 279-287, Compendex.
  23. A Fast Linear Programming Algorithm for Blind Equalization
    Ding, Z.; Luo, Z.-Q.
    IEEE Transactions on Communications, 2000, vol. 48, no. 9, pp. 1432-1436, Ingenta.  
  24. Parallel algorithms to solve two-stage stochastic linear programs with robustness constraints
    Beraldi, P.; Grandinetti, L.; Musmanno, R.; Triki, C.  
    Parallel Computing, v 26, n 13-14, Dec, 2000, p 1889-1908, Compendex.
  25. A Primal-Dual Variant of the Iri-Imai Algorithm for Linear Programming.
    Tutuncu, Reha H.
    Mathematics of Operations Research, 2000, vol. 25, no. 2, pp. 195, Ingenta.  
  26. Evolutionary algorithm solution to fuzzy problems: Fuzzy linear programming.
    Buckley, J.J.; Feuring, T.
    Fuzzy sets and systems, 2000, vol. 109, no. 1, pp. 35, Ingenta.  
  27. Linear programming with fuzzy variables
    Maleki, H.R.; Tata, M.; Mashinchi, M.
    Fuzzy Sets and Systems, v 109, n 1, Jan 1, 2000, p 21-33, Compendex.
  28. The emergence of nonlinear programming : interactions between practical mathematics and mathematics proper
    T H Kjeldsen
    Math. Intelligencer 22 (3) (2000), 50-54.
  29. Integer Programming and Conway's Game of Life (in Education)  
    Robert A. Bosch  
    SIAM Review, Vol. 41, No. 3. (Sep., 1999), pp. 594-604, Jstor.  
  30. A New perturbation simplex algorithm for linear programming
    Pan, Ping-qi   
    Journal of Computational Mathematics, v 17, n 3, 1999, p 233-242, Compendex.
  31. A projective simplex method for linear programming
    Pan P.-Q.
    Linear Algebra and its Applications, 1 May 1999, vol. 292, no. 1, pp. 99-125(27), Ingenta.   
  32. Convergence of a class of inexact interior-point algorithms for linear programs
    Freund, Roland W.; Jarre, Florian; Mizuno, Shinji  
    Mathematics of Operations Research, v 24, n 1, Feb, 1999, p 50-71, Compendex.  
  33. Numerical Verification of Second-Order Sufficiency Conditions for Nonlinear Programming (in Classroom Notes)  
    Terrence K. Kelly; Michael Kupferschmid  
    SIAM Review, Vol. 40, No. 2. (Jun., 1998), pp. 310-314, Jstor.
  34. A New Steepest Edge Approximation for the Simplex Method for Linear Programming
    Sacutewieogontanowski A.
    Computational Optimization and Applications, July 1998, vol. 10, no. 3, pp. 271-281(11), Ingenta.   
  35. A Dual Projective Simplex Method for Linear Programming
    Ping-Qi P.
    Computers and Mathematics with Applications, March 1998, vol. 35, no. 6, pp. 119-135(17), Ingenta.   
  36. A Basis-Deficiency-Allowing Variation of the Simplex Method for Linear Programming
    Pan P.-Q.
    Computers and Mathematics with Applications, August 1998, vol. 36, no. 3, pp. 33-53(21), Ingenta.   
  37. Hoffman's Circle Untangled (in Classroom Notes)  
    Jon Lee  
    SIAM Review, Vol. 39, No. 1. (Mar., 1997), pp. 98-105, Jstor.
  38. Differentiable Selection of Optimal Solutions in Parametric Linear Programming  
    Dinh the Luc; Pham Huy Dien  
    Proceedings of the American Mathematical Society, Vol. 125, No. 3. (Mar., 1997), pp. 883-892, Jstor.  
  39. Initialization of the Simplex Algorithm: An Artificial-Free Approach (in Classroom Notes)  
    H. Arsham  
    SIAM Review, Vol. 39, No. 4. (Dec., 1997), pp. 736-744, Jstor.  
  40. Linear programming, the simplex algorithm and simple polytopes.
    Kalai, G.
    Mathematical programming, 1997, vol. 79, no. 1/3, pp. 217, Ingenta.  
  41. The solution of linear interval equations by a linear programming method
    Aberth, Oliver  
    Linear Algebra and Its Applications, v 259, n 1-3, Jul 1, 1997, p 271-279, Compendex.
  42. Integer Programming  
    Joe F. Wampler; Stephen E. Newman  
    The College Mathematics Journal, Vol. 27, No. 2. (Mar., 1996), pp. 95-100, Jstor.  
  43. On Copying a Compact Disk to Cassette Tape: An Integer-Programming Approach (in Notes)  
    Saul I. Gass  
    Mathematics Magazine, Vol. 69, No. 1. (Feb., 1996), pp. 57-61, Jstor.  
  44. The Evolution of Methods of Convex Optimization (in The Evolution of ...)  
    V. M. Tikhomirov  
    The American Mathematical Monthly, Vol. 103, No. 1. (Jan., 1996), pp. 65-71, Jstor.   
  45. The Use of Linear Programming in the Construction of Extremal Solutions to Linear Inverse Problems (in Classroom Notes)  
    Stephen P. Huestis  
    SIAM Review, Vol. 38, No. 3. (Sep., 1996), pp. 496-506, Jstor.  
  46. Semidefinite Programming  
    Lieven Vandenberghe; Stephen Boyd  
    SIAM Review, Vol. 38, No. 1. (Mar., 1996), pp. 49-95, Jstor.   
  47. An asymptotical O(sqrt nL)-iteration path-following linear programming algorithm that uses wide neighborhoods.
    Hung, Pi-Fang; Ye, Yinyu
    SIAM J. Optim. 6 (1996), no. 3, 570--586, MathSciNet.  
  48. A New Finite Continuation Algorithm for Linear Programming.
    Madsen, Kaj; Nielsen, Hans Bruun; Pinar, Mustafa C.
    SIAM journal on optimization, 1996, vol. 6, no. 3, pp. 600, Ingenta.  
  49. A lower bound on the number of iterations of long-step primal-dual linear programming algorithms. Interior point methods in mathematical programming.
    Todd, Michael J.; Ye, Yinyu
    Ann. Oper. Res. 62 (1996), 233--252, MathSciNet.  
  50. An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming.
    Potra, Florian A.
    SIAM journal on optimization, 1996, vol. 6, no. 1, pp. 19, Ingenta.  
  51. The implementation of linear programming algorithms based on homotopies.
    Nazareth, J. L.
    Algorithmica 15 (1996), no. 4, 332--350, MathSciNet.  
  52. Gigaflops in linear programming
    Lustig, Irvin J.; Rothberg, Edward
    Operations Research Letters, v 18, n 4, February, 1996, p 157-165, Compendex.
  53. A modified bisection simplex method for linear programming.  
    Pan, P. Q.
    J. Comput. Math.  14  (1996),  no. 3, 249--255, MathSciNet.  
  54. A Practical Geometrically Convergent Cutting Plane Algorithm  
    M. A. H. Dempster; R. R. Merkovsky  
    SIAM Journal on Numerical Analysis, Vol. 32, No. 2. (Apr., 1995), pp. 631-644, Jstor.
  55. A Nonlinear Programming Algorithm for Hospital Management (in Classroom Notes)  
    Frank H. Mathis; Lenora Jane Mathis  
    SIAM Review, Vol. 37, No. 2. (Jun., 1995), pp. 230-234, Jstor.
  56. A predictor-corrector infeasible-interior-point algorithm for linear programming.
    Mizuno, S.
    Operations research letters, 1994, vol. 16, no. 2, pp. 61, Ingenta.  
  57. Probabilistic Analysis in Linear Programming  
    Ron Shamir  
    Statistical Science, Vol. 8, No. 1, Report from the Committee on Applied and Theoretical Statistics of the National Research Council on Probability and Algorithms. (Feb., 1993), pp. 57-64, Jstor.  
  58. On the number of iterations of Karmarkar's algorithm for linear programming.
    Powell, M.J.F.
    Mathematical programming, 1993, vol. 62, no. 1, pp. 153, Ingenta.  
  59. A collinear scaling interpretation of Karmarkar's linear programming algorithm.
    Lagarias, J. C.
    SIAM J. Optim. 3 (1993), no. 3, 630--636, MathSciNet.  
  60. Path-Following Methods for Linear Programming  
    Clovis C. Gonzaga  
    SIAM Review, Vol. 34, No. 2. (Jun., 1992), pp. 167-224, Jstor.  
  61. A simplex algorithm for piecewise-linear programming III: Computational analysis and applications.
    Fourer, R.
    Mathematical programming, 1992, vol. 53, no. 2, pp. 213, Ingenta.   
  62. Steepest-edge simplex algorithms for linear programming.  
    Forrest, John J.; Goldfarb, Donald
    Math. Programming  57  (1992),  no. 3, Ser. A, 341--374, MathSciNet.  
  63. On the finite convergence of interior-point algorithms for linear programming
    Ye, Yinyu   
    Mathematical Programming, Series B, v 57, n 2, Nov 2, 1992, p 325-335, Compendex.
  64. On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms.
    Zhang, Yin; Tapia, Richard A.; Dennis, John E., Jr.
    SIAM J. Optim. 2 (1992), no. 2, 304--324, MathSciNet.  
  65. Linear programming system (UH-Simplex). (Spanish)  
    Vilariño Ayala, Darnes; Verdaguer Horta, Rolando; Vallejo Zamora, Yania; Gómez Fernández-Britto, Néstor; Tey, Joaquín
    Investigación Oper.  13  (1992),  no. 2, 179--181, MathSciNet.  
  66. A parallel characteristics analysis of linear programming algorithms. (Chinese)
    Zhao, Feng Zhi
    J. Numer. Methods Comput. Appl. 13 (1992), no. 2, 131--138, MathSciNet.  
  67. A simplex-like method with bisection for linear programming.  
    Pan, Ping Qi
    Optimization  22  (1991),  no. 5, 717--743, MathSciNet.  
  68. An optimal-basis identification technique for interior-point linear programming algorithms. Interior point methods for linear programming.
    Tapia, R. A.; Zhang, Yin
    Linear Algebra Appl. 152 (1991), 343--363, MathSciNet.  
  69. A Tool for Teaching Linear Programming within MATLAB (in Classroom Computer Capsules)  
    David R. Hill  
    The College Mathematics Journal, Vol. 21, No. 1. (Jan., 1990), pp. 55-56, Jstor.  
  70. The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry  
    J. C. Lagarias  
    Transactions of the American Mathematical Society, Vol. 320, No. 1. (Jul., 1990), pp. 193-225, Jstor.  
  71. A Dantzig--Wolfe-Like Variant of Karmarkar's Interior Point Linear Programming Algorithm.
    Tood, Michael J.
    Operations research, 1990, vol. 38, no. 6, pp. 1006, Ingenta.   
  72. An efficient algorithm for linear programming.
    Venkaiah, V.Ch.
    Proceedings of the Indian Academy of Sciences, 1990, vol. 100, no. 3, pp. 295, Ingenta.   
  73. Linear Programming Algorithm for Neural Networks.
    Shawe-Taylor, John S.; Cohen, Dave A.
    Neural networks, 1990, vol. 3, no. 5, pp. 575, Ingenta.   
  74. Impact of linear programming on computer development
    G B Dantzig  
    Computers in mathematics, Stanford, CA, 1986 (New York, 1990), 233-240.
  75. The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories  
    D. A. Bayer; J. C. Lagarias  
    Transactions of the American Mathematical Society, Vol. 314, No. 2. (Aug., 1989), pp. 499-526, Jstor.  
  76. The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories  
    D. A. Bayer; J. C. Lagarias  
    Transactions of the American Mathematical Society, Vol. 314, No. 2. (Aug., 1989), pp. 527-581, Jstor.  
  77. The Simplex Method of Linear Programming on Microcomputer Spreadsheets (in Computer Corner)  
    Frank S. T. Hsiao  
    The College Mathematics Journal, Vol. 20, No. 2. (Mar., 1989), pp. 153-160, Jstor.  
  78. The effects of degeneracy and null and unbounded variables on variants of Karmarkar's linear programming algorithm.
    Todd, Michael J.
    Large-scale numerical optimization (Ithaca, NY, 1989), 81--91, SIAM, Philadelphia, PA, 1990, MathSciNet.  
  79. An implementation of Karmarkar's algorithm for linear programming.
    Adler, I.; Resende, M.G.C.; Veiga, G.
    Mathematical programming, 1989, vol. 44, no. 3, pp. 297, Ingenta.   
  80. A sequential linear programming algorithm for solving monotone variational inequalities.
    Marcotte, Patrice; Dussault, Jean-Pierre
    SIAM J. Control Optim. 27 (1989), no. 6, 1260--1278, MathSciNet.  
  81. A variant of Karmarkar's linear programming algorithm for problems with some unrestricted variables.
    Mitchell, John E.; Todd, Michael J.
    SIAM J. Matrix Anal. Appl. 10 (1989), no. 1, 30--38, MathSciNet.  
  82. Eliminating columns in the simplex method for linear programming.  
    Ye, Y.
    J. Optim. Theory Appl.  63  (1989),  no. 1, 69--77, MathSciNet.  
  83. A Steepest Edge Active Set Algorithm for Solving Sparse Linear Programming Problems.
    Sloan, S.W.
    International journal for numerical methods in e, 1988, vol. 26, no. 12, pp. 2671, Ingenta.   
  84. Improved bounds and containing ellipsoids in Karmarkar's linear programming algorithm.
    Todd, Michael J.
    Math. Oper. Res. 13 (1988), no. 4, 650--659, MathSciNet.  
  85. Exploiting special structure in Karmarkar's linear programming algorithm.
    Todd, Michael J.
    Math. Programming 41 (1988), no. 1, (Ser. A), 97--113, MathSciNet.  
  86. A dual interior primal simplex method for linear programming.  
    Tamura, Akihisa; Takehara, Hitoshi; Fukuda, Komei; Fujishige, Satoru; Kojima, Masakazu
    J. Oper. Res. Soc. Japan  31  (1988),  no. 3, 413--430, MathSciNet.  
  87. Convergence in Karmarkar's Algorithm for Linear Programming  
    Joel Franklin  
    SIAM Journal on Numerical Analysis, Vol. 24, No. 4. (Aug., 1987), pp. 928-945, Jstor.  
  88. A note on comparing simplex and interior methods for linear programming.  
    Tomlin, J. A.
    Progress in mathematical programming (Pacific Grove, CA, 1987),  91--103, Springer, New York, 1989, MathSciNet.  
  89. An Interview with George B. Dantzig: The Father of Linear Programming  
    Donald J. Albers; Constance Reid; George B. Dantzig  
    The College Mathematics Journal, Vol. 17, No. 4. (Sep., 1986), pp. 292-314, Jstor.  
  90. Fourier's Method of Linear Programming and Its Dual  
    H. P. Williams  
    The American Mathematical Monthly, Vol. 93, No. 9. (Nov., 1986), pp. 681-695, Jstor.  
  91. A modification of Karmarkar's linear programming algorithm.
    Vanderbei, Robert J.; Meketon, Marc S.; Freedman, Barry A.
    Algorithmica 1 (1986), no. 4, 395--407, MathSciNet.  
  92. A simplex method for linear programming problems with free variables. (Chinese)  
    He, Ming Feng
    J. Dalian Inst. Tech.  25  (1986),  Special Issue on Mathematics, suppl., 108--112, MathSciNet.  
  93. Implementation of a double-basis simplex method for the general linear programming problem.  
    Proctor, P. E.
    SIAM J. Algebraic Discrete Methods  6  (1985),  no. 4, 567--575, MathSciNet.  
  94. A new polynomial linear programming algorithm. (Russian)
    Nurminski\u\i, E. A.; Andrusenko, S. K.; Stetsyuk, P. I.
    Kibernetika (Kiev) 1985, no. 4, iv, 118--120, 136, MathSciNet.  
  95. Duality in the Classroom (in Notes)  
    Gilbert Strang  
    American Mathematical Monthly, Vol. 91, No. 4. (Apr., 1984), pp. 250+251-254, Jstor.  
  96. An Application of Graph Theory and Integer Programming: Chessboard Non-Attacking Puzzles (in Notes)  
    L. R. Foulds; D. G. Johnston  
    Mathematics Magazine, Vol. 57, No. 2. (Mar., 1984), pp. 95-104, Jstor.  
  97. A New Polynomial-Time Algorithm for Linear Programming
    Karmarkar, N.
    Combinatorica 4, 373-395, 1984.
  98. The discovery of linear programming  
    G B Dantzig; Dorfman, R
    Ann. Hist. Comput. 6 (3) (1984), 283-295.
  99. A look back at the origins of linear programming (Chinese)  
    G B Dantzig  
    Chinese J. Oper. Res. 3 (1) (1984), 71-78.
  100. Mathematical Methods of Economics  
    Joel Franklin  
    American Mathematical Monthly, Vol. 90, No. 4. (Apr., 1983), pp. 229-244, Jstor.  
  101. A linear programming algorithm for curve fitting in the L-infty norm.
    Armstrong, Ronald D.; Sklar, Michael G.
    Numer. Funct. Anal. Optim. 2 (1980), no. 2-3, 187--218, MathSciNet.  
  102. Khachiyan's linear programming algorithm.
    Aspvall, Bengt; Stone, Richard E.
    J. Algorithms 1 (1980), no. 1, 1--13, MathSciNet.  
  103. On the average number of steps of the simplex method of linear programming.  
    Smale, Steve
    Math. Programming  27  (1983),  no. 3, 241--262, MathSciNet.  
  104. An implementation of the simplex method for linear programming problems with variable upper bounds.  
    Todd, Michael J.
    Math. Programming  23  (1982), no. 1, 34--49, MathSciNet.  
  105. Time-staged methods in linear programming : comments, early history, future prospects
    G B Dantzig  
    Large scale systems, Cleveland, Ohio, 1980 (Amsterdam-New York, 1982), 19-30.
  106. A comparison of interval linear programming with the simplex method.  
    Gunn, E. A.; Anders, G. J.
    Linear Algebra Appl.  38  (1981), 149--159, MathSciNet.  
  107. Two Linear Programming Algorithms for the Linear Discrete L1 Norm Problem  
    Ronald D. Armstrong; James P. Godfre  
    Mathematics of Computation, Vol. 33, No. 145. (Jan., 1979), pp. 289-300, Jstor.  
  108. Recent Developments in the Numerical Solution of Partial Differential Equations by Linear Programming  
    To-Yat Cheung  
    SIAM Review, Vol. 20, No. 1. (Jan., 1978), pp. 139-167, Jstor.  
  109. Linear Programming Algorithms for the Chebyshev Solution to a System of Consistent Linear Equations  
    Uri Ascher  
    SIAM Journal on Numerical Analysis, Vol. 14, No. 3. (Jun., 1977), pp. 519-526, Jstor.  
  110. Frank Knight's Theorem in Linear Programming Revisited  
    W. E. Diewert; A. D. Woodland  
    Econometrica, Vol. 45, No. 2. (Mar., 1977), pp. 375-398, Jstor.  
  111. Linear programming algorithms for the Chebyshev solution to a system of consistent linear equations.
    Ascher, Uri
    SIAM J. Numer. Anal. 14 (1977), no. 3, 519--526, MathSciNet.  
  112. Optimal Investment under Risk  
    Daniel Gallin; Edwin Shapiro  
    Mathematics Magazine, Vol. 49, No. 5. (Nov., 1976), pp. 235-238, Jstor.  
  113. A Sequential Approach to the 0-1 Linear Programming Problem  
    Nicos Christofides; Mary Trypia  
    SIAM Journal on Applied Mathematics, Vol. 31, No. 2. (Sep., 1976), pp. 271-285, Jstor.  
  114. Primal Geometric Programs Treated by Linear Programming  
    Aharon Ben-Tal; Adi Ben-Israel  
    SIAM Journal on Applied Mathematics, Vol. 30, No. 3. (May, 1976), pp. 538-556, Jstor.  
  115. Linear Programming Via a Nondifferentiable Penalty Function  
    A. R. Conn  
    SIAM Journal on Numerical Analysis, Vol. 13, No. 1. (Mar., 1976), pp. 145-154, Jstor.  
  116. An Integer Programming Handicap System in a "Write Ring Tossing Game"  
    Eugene F. Schuster  
    Mathematics Magazine, Vol. 48, No. 3. (May, 1975), pp. 134-142, Jstor.  
  117. Geometric Approach to Linear Programming in the Two-Year College (in Mathematical)  
    Pat Semmes  
    The Two-Year College Mathematics Journal, Vol. 5, No. 1. (Winter, 1974), pp. 37-40, Jstor.  
  118. A Method for the Solution of the Distribution Problem of Stochastic Linear Programming  
    James B. Ewbank; Bob L. Foote; Hillel J. Kumin  
    SIAM Journal on Applied Mathematics, Vol. 26, No. 2. (Mar., 1974), pp. 225-238, Jstor.  
  119. The Generalized Inverse in Linear Programming--An Intersection Projection Method and the Solution of a Class of Structured Linear Programming Problems  
    R. E. Cline; L. D. Pyle  
    SIAM Journal on Applied Mathematics, Vol. 24, No. 3. (May, 1973), pp. 338-351, Jstor.  
  120. Quasilinear Parabolic Boundary Value Problems. Approximate Solutions and Error Bounds by Linear Programming  
    To-Yat Cheung  
    SIAM Journal on Numerical Analysis, Vol. 10, No. 6. (Dec., 1973), pp. 1061-1079, Jstor.  
  121. A Price Schedules Decomposition Algorithm for Linear Programming Problems  
    Peter Jennergren  
    Econometrica, Vol. 41, No. 5. (Sep., 1973), pp. 965-980, Jstor.  
  122. The Generalized Inverse in Linear Programming--Interior Gradient Projection Methods  
    L. D. Pyle; R. E. Cline  
    SIAM Journal on Applied Mathematics, Vol. 24, No. 4. (Jun., 1973), pp. 511-534, Jstor.  
  123. Two-Dimensional Graphical Solution of Higher-Dimensional Linear Programming Problems  
    W. P. Cooke  
    Mathematics Magazine, Vol. 46, No. 2. (Mar., 1973), pp. 70-76, Jstor.  
  124. The Generalized Inverse in Linear Programming. Basic Structure  
    L. D. Pyle  
    SIAM Journal on Applied Mathematics, Vol. 22, No. 3. (May, 1972), pp. 335-355, Jstor.  
  125. Linear Programming in Reflexive Spaces  
    Carl Kallina; A. C. Williams  
    SIAM Review, Vol. 13, No. 3. (Jul., 1971), pp. 350-376, Jstor.  
  126. Linear Programming in Reflexive Spaces  
    Carl Kallina; A. C. Williams  
    SIAM Review, Vol. 13, No. 3. (Jul., 1971), pp. 350-376, Jstor.  
  127. Revised Simplex Method for Quadratic Programming  
    M. H. Rusin  
    SIAM Journal on Applied Mathematics, Vol. 20, No. 2. (Mar., 1971), pp. 143-160.
  128. Algorithm AS 47: Function Minimization Using a Simplex Procedure (in Statistical Algorithms)  
    R. O'Neill  
    Applied Statistics, Vol. 20, No. 3. (1971), pp. 338-345, Jstor.  
  129. Linear Programming Models for National Planning: Demonstration of a Testing Procedure  
    Jeffrey B. Nugent  
    Econometrica, Vol. 38, No. 6. (Nov., 1970), pp. 831-855, Jstor.  
  130. A mutual primal-dual linear programming algorithm.  
    Harris, Milton Y.
    Naval Res. Logist. Quart.  17  1970 199--206, MathSciNet.  
  131. Short Notes: Complementary Theorems for Linear Programming  
    A. C. Williams  
    SIAM Review, Vol. 12, No. 1. (Jan., 1970), pp. 135-137, Jstor.  
  132. Integer Programming Technique to Construct Statistical Tests (in The Teacher's Corner)  
    Jacob Paroush  
    The American Statistician, Vol. 23, No. 5. (Dec., 1969), pp. 43-44, Jstor.  
  133. The Symmetric Formulation of the Simplex Method for Quadratic Programming  
    C. van de Panne; Andrew Whinston  
    Econometrica, Vol. 37, No. 3. (Aug., 1969), pp. 507-527, Jstor.  
  134. The simplex method of linear programming using LU decomposition  
    Richard H. Bartels; Gene H. Golub
    Source     Communications of the ACM, Volume 12 ,  Issue 5  (May 1969), Pages: 266 - 268.  
  135. Extensions of Lagrange Multipliers in Nonlinear Programming  
    F. J. Gould  
    SIAM Journal on Applied Mathematics, Vol. 17, No. 6. (Nov., 1969), pp. 1280-1297, Jstor.  
  136. Applications of Linear Programming to Numerical Analysis  
    Philip Rabinowitz  
    SIAM Review, Vol. 10, No. 2. (Apr., 1968), pp. 121-159, Jstor.  
  137. An Extended Duality Theorem for Continuous Linear Programming Problems  
    William F. Tyndall  
    SIAM Journal on Applied Mathematics, Vol. 15, No. 5. (Sep., 1967), pp. 1294-1298, Jstor.  
  138. On Parametric Linear Programming  
    Leopold B. Willner  
    SIAM Journal on Applied Mathematics, Vol. 15, No. 5. (Sep., 1967), pp. 1253-1257, Jstor.  
  139. Errata: On Stochastic Linear Programming  
    A. C. Williams  
    SIAM Journal on Applied Mathematics, Vol. 15, No. 1. (Jan., 1967), p. 228, Jstor.  
  140. Self-Duality in Mathematical Programming  
    S. L. Mehndiratta  
    SIAM Journal on Applied Mathematics, Vol. 15, No. 5. (Sep., 1967), pp. 1156-1157, Jstor.  
  141. Approximation Formulas for Stochastic Linear Programming  
    A. C. Williams  
    SIAM Journal on Applied Mathematics, Vol. 14, No. 4. (Jul., 1966), pp. 668-677, Jstor.  
  142. The Stability of Truncated Solutions of Stochastic Linear Programming  
    J. K. Sengupta  
    Econometrica, Vol. 34, No. 1. (Jan., 1966), pp. 77-104, Jstor.  
  143. A Simplex-Type Algorithm for Linear and Quadratic Programming--A Parametric Procedure  
    R. Jagannathan  
    Econometrica, Vol. 34, No. 2. (Apr., 1966), pp. 460-471, Jstor.  
  144. Une Methode Graphique de Resolution de Certains Types de Programmes Lineaires de Grandes Dimensions  
    J. Klatzmann; G. Matthys  
    Econometrica, Vol. 34, No. 2. (Apr., 1966), pp. 481-490, Jstor.
  145. Self-Duality in Mathematical Programming  
    Bertram Mond; Richard W. Cottle
    SIAM Journal on Applied Mathematics, Vol. 14, No. 3. (May, 1966), pp. 420-423, Jstor.  
  146. Mathematical Programming  
    R. E. Gomory  
    American Mathematical Monthly, Vol. 72, No. 2, Part 2: Computers and Computing. (Feb., 1965), pp. 99-110, Jstor.  
  147. On Stochastic Linear Programming  
    A. C. Williams  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 4. (Dec., 1965), pp. 927-940, Jstor.  
  148. A Duality Theorem for a Class of Continuous Linear Programming Problems  
    William F. Tyndall  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 3. (Sep., 1965), pp. 644-666, Jstor.  
  149. A Short Proof of the Duality Theorem of Linear Programming  
    V. P. Sreedharan  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 13, No. 2. (Jun., 1965), pp. 423-424, Jstor.  
  150. The Composite Simplex Algorithm  
    Philip Wolfe  
    SIAM Review, Vol. 7, No. 1. (Jan., 1965), pp. 42-54, Jstor.  
  151. A comparison of the primal-simplex and primal-dual algorithms for linear programming.  
    Mueller, R. K.; Cooper, L.
    Comm. ACM  8  1965, 682--686, MathSciNet.  
  152. The Numerical Solution of the Dirichlet Problem for Laplace's Equation by Linear Programming  
    J. R. Cannon  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 12, No. 1. (Mar., 1964), pp. 233-237, Jstor.  
  153. Optimum simplex methods and degeneracy in linear programming.  
    Altman, M.
    Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.  12  1964, 217--225, MathSciNet.  
  154. A Technique for Resolving Degeneracy in Linear Programming  
    Philip Wolfe  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 11, No. 2. (Jun., 1963), pp. 205-211, Jstor.  
  155. Marginal Values in Linear Programming  
    A. C. Williams  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 11, No. 1. (Mar., 1963), pp. 82-94, Jstor.  
  156. Linear Programming and Extensions  
    Dantzig, G. B.
    Princeton, NJ: Princeton University Press, 1963.
  157. An Application of Generalized Linear Programming to Network Flows  
    R. E. Gomory; T. C. Hu  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 10, No. 2. (Jun., 1962), pp. 260-283, Jstor.  
  158. The Decomposition Algorithm for Linear Programs  
    George B. Dantzig; Philip Wolfe
    Econometrica, Vol. 29, No. 4. (Oct., 1961), pp. 767-778, Jstor.  
  159. Remark on the Constraint Sets in Linear Programming (in Mathematical Notes)  
    Frank Eugene Clark  
    American Mathematical Monthly, Vol. 68, No. 4. (Apr., 1961), pp. 351-352, Jstor.  
  160. The Constrained Gradient Method of Linear Programming  
    C. E. Lemke  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 9, No. 1. (Mar., 1961), pp. 1-17, Jstor.  
  161. Linear Programming and Approximation Problems (in Classroom Notes)  
    L. E. Ward, Jr.  
    American Mathematical Monthly, Vol. 68, No. 1. (Jan., 1961), pp. 46-53, Jstor.  
  162. Nonlinear Programming by the Simplex Method  
    H. O. Hartley  
    Econometrica, Vol. 29, No. 2. (Apr., 1961), pp. 223-237, Jstor.  
  163. A Note on Stochastic Linear Programming  
    Gerhard Tintner  
    Econometrica, Vol. 28, No. 2. (Apr., 1960), pp. 490-495, Jstor.  
  164. On the Significance of Solving Linear Programming Problems with Some Integer Variables  
    George B. Dantzig  
    Econometrica, Vol. 28, No. 1. (Jan., 1960), pp. 30-44, Jstor.  
  165. The Simplex Method for Quadratic Programming (in Errata)  
    Philip Wolfe  
    Econometrica, Vol. 28, No. 1. (Jan., 1960), p. 170, Jstor.  
  166. Market Mechanisms and Mathematical Programming  
    Hirofumi Uzawa  
    Econometrica, Vol. 28, No. 4. (Oct., 1960), pp. 872-881, Jstor.  
  167. Integer Programming and Pricing  
    Ralph E. Gomory; William J. Baumol  
    Econometrica, Vol. 28, No. 3. (Jul., 1960), pp. 521-550, Jstor.  
  168. Virtual Work, Linear Programming and Plastic Limit Analysis  
    A. Charnes; C. E. Lemke; O. C. Zienkiewicz  
    Proceedings of the Royal Society of London. Series A, Mathematical and Physical Sciences, Vol. 251, No. 1264. (May 12, 1959), pp. 110-116, Jstor.  
  169. The Simplex Method for Quadratic Programming  
    Philip Wolfe  
    Econometrica, Vol. 27, No. 3. (Jul., 1959), pp. 382-398, Jstor.  
  170. An Application of Linear Programming to Curve Fitting  
    James E. Kelley, Jr.  
    Journal of the Society for Industrial and Applied Mathematics, Vol. 6, No. 1. (Mar., 1958), pp. 15-22, Jstor.  
  171. A Linear Programming Model of the U. S. Petroleum Refining Industry  
    Alan S. Manne  
    Econometrica, Vol. 26, No. 1. (Jan., 1958), pp. 67-106, Jstor.  
  172. Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming  
    A. Charnes; W. W. Cooper  
    Econometrica, Vol. 25, No. 1. (Jan., 1957), pp. 132-153, Jstor.  
  173. Linear Programming in Practice  
    Emil Kay; Eric Duckworth  
    Applied Statistics, Vol. 6, No. 1. (Mar., 1957), pp. 26-39, Jstor.  
  174. Systems of Distinct Representations and Linear Programming  
    A. J. Hoffman, H. W. Kuhn  
    American Mathematical Monthly, Vol. 63, No. 7. (Aug. - Sep., 1956), pp. 455-460, Jstor.  
  175. The Application of Linear Programming to Competitive Bond Bidding  
    Jerome Percus; Leon Quinto  
    Econometrica, Vol. 24, No. 4. (Oct., 1956), pp. 413-428, Jstor.  
  176. The "simplex" method in linear programming. (Spanish)  
    San Juan Llosá, Ricardo
    Trabajos Estadist.  7  (1956), 199--219, MathSciNet.  
  177. Optimal Solution of a Dynamic Leontief Model with Substitution  
    George B. Dantzig  
    Econometrica, Vol. 23, No. 3. (Jul., 1955), pp. 295-302, Jstor.  
  178. Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming  
    George B. Dantzig  
    Econometrica, Vol. 23, No. 2. (Apr., 1955), pp. 174-183, Jstor.  
  179. A Short Cut to Linear Programming  
    Frederick V. Waugh; Glenn L. Burrows
    Econometrica, Vol. 23, No. 1. (Jan., 1955), pp. 18-29, Jstor.  
  180. An Outline of Linear Programming (in Symposium on Linear Programming)  
    S. Vajda  
    Journal of the Royal Statistical Society. Series B (Methodological), Vol. 17, No. 2. (1955), pp. 165-172, Jstor.  
  181. On Minizing A Convex Function Subject to Linear Inequalities (in Symposium on Linear Programming)  
    E. M. L. Beale  
    Journal of the Royal Statistical Society. Series B (Methodological), Vol. 17, No. 2. (1955), pp. 173-184, Jstor.  
  182. The "simplex" method of linear programming. (Spanish)  
    San Juan Llosá, Ricardo
    Rev. Ci. Apl.  8  (1954), 481--492; corrections 9 (1955), 133--136, MathSciNet.  
  183. The Product Form for the Inverse in the Simplex Method  
    George B. Dantzig, Wm. Orchard-Hays  
    Mathematical Tables and Other Aids to Computation, Vol. 8, No. 46. (Apr., 1954), pp. 64-67, Jstor.  
  184. Optimality and Degeneracy in Linear Programming  
    A. Charnes  
    Econometrica, Vol. 20, No. 2. (Apr., 1952), pp. 160-170, Jstor.  
  185. Programming of Interdependent Activities: II Mathematical Model  
    George B. Dantzig  
    Econometrica, Vol. 17, No. 3/4. (Jul. - Oct., 1949), pp. 200-211, Jstor.   
  186. Programming of Interdependent Activities: I General Discussion  
    Marshall K. Wood; George B. Dantzig  
    Econometrica, Vol. 17, No. 3/4. (Jul. - Oct., 1949), pp. 193-199, Jstor.   

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005