| Information-theoretic approach to unimodal density estimation | 5 | 0.83 | 1995 |
| An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models | 8 | 4.27 | 1993 |
| Two simple applications of the unimodularity property | 1 | 0.37 | 1993 |
| Information theoretic approach to geometric programming | 0 | 0.34 | 1991 |
| Stability of efficiency evaluations in data envelopment analysis | 5 | 0.96 | 1989 |
| Implementation of successive linear programming algorithms for non-convex goal programming | 1 | 0.42 | 1988 |
| Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method | 3 | 0.98 | 1986 |
| A developmental study of data envelopment analysis in measuring the efficiency of maintenance units in the U.S. air forces | 77 | 39.10 | 1984 |
| Data envelopment analysis and regression approaches to efficiency estimation and evaluation | 22 | 12.09 | 1984 |
| The extreme point characterization of semi-infinite dual non-Archimedean balls | 1 | 0.45 | 1984 |
| Preface to topics in data envelopment analysis | 53 | 22.29 | 1984 |
| Sensitivity and stability analysis in DEA | 29 | 31.48 | 1984 |
| Separably-infinite programs | 2 | 0.55 | 1980 |
| Complexity and computability of solutions to linear programming systems. | 3 | 0.92 | 1980 |
| Polyextremal principles and separably-infinite programs | 0 | 0.34 | 1980 |
| Page Cuts For Integer Interval Linear-Programming | 5 | 2.76 | 1979 |
| Technical Note-On Intersection Cuts in Interval Integer Linear Programming | 0 | 0.34 | 1977 |
| Constructive proofs of theorems relating to:F(x) = y, with applications | 6 | 8.10 | 1977 |
| Coalitional And Chance-Constrained Solutions To N-Person Games .2. 2-Stage Solutions | 8 | 1.35 | 1977 |
| Primal and dual optimality criteria in convex programming | 0 | 0.34 | 1977 |
| Algorithm For Solving Interval Linear-Programming Problems | 5 | 1.28 | 1977 |
| Existence and representation of diophantine and mixed diophantine solutions to linear equations and inequalities | 0 | 0.34 | 1975 |
| <Emphasis Type="Italic">V</Emphasis>-positivity, poverses and the economic global unicity theorems of Gale and Nikaido | 1 | 0.36 | 1975 |
| Past, present and future of large scale transshipment computer codes and applications | 4 | 1.23 | 1975 |
| On generation of test problems for linear programming codes | 6 | 3.91 | 1974 |
| Letter to the Editor--Comments on a Letter by Woolsey | 0 | 0.34 | 1973 |
| Note On A Distribution Problem | 0 | 0.34 | 1970 |
| On Explicit Solution Of A Special Class Of Linear Economic Models | 3 | 0.78 | 1970 |
| On Stochastic Linear Approximation Problems | 0 | 0.34 | 1970 |
| An Explicit Solution of a Special Class of Linear Programming Problems | 12 | 3.67 | 1968 |
| Chance-Constrained Games With Partially Controllable Strategies | 1 | 0.37 | 1968 |
| Chance-Constrained Generalized Networks | 0 | 0.34 | 1966 |
| 1-Pass Algorithms For Some Generalized Network Problems | 7 | 2.47 | 1966 |
| Such Solutions Are Very Little Solved | 0 | 0.34 | 1955 |
| Linear Programming And Profit Preference Scheduling For A Manufacturing Firm | 3 | 0.78 | 1953 |
| Computational problems of linear programing | 0 | 0.34 | 1952 |
