1. A. B-I, The Geometry of Solvability and Duality
in Linear Programming, Israel J. Math. 1 (1963), 181-187
2. A. B-I, Notes on Linear Inequalities, I:
The Intersection of the Nonnegative Orthant with Complementary Orthogonal
Subspaces, J. Math. Anal. Appl.
9(1964), 303-314
3. A. B-I and A. Charnes, On the
Intersection of Cones and Subspaces, Bull. Amer. Math. Soc.
74(1968), 541-544
4.
A. B-I, On Optimal Solutions of 2-person 0-sum Games, Atti
Accad Naz. Lincei Rend. Cl. Sci. Fis. Mat. Natur. (8) 44(1968), 274-278
5.
A. B-I and A. Charnes, An Explicit Solution of a Special Class of
Linear Programming Problems, Oper. Res. 16(1968), 1166-1175
6.
A. B-I, A. Charnes and K.O. Kortanek, Duality and Asymptotic Solvability
over Cones, Bull. Amer. Math. Soc. 75 (1969), 318-324
(Erratum, ibid 76 (1970), 426)
7. A. B-I, Linear Equations and Inequalities on Finite- Dimensional, Real or
Complex, Vector Spaces: A Unified Theory, J. Math. Anal. Appl. 27(1969),
367-389
8.
A. B-I, Theorems of the Alternative for Complex Linear Inequalities, Israel J. Math. 7 (1969),
121-136 (Erratum, ibid 7(1969), 293)
9.
P.D. Robers and A. B-I, Interval Programming: A New Approach to Linear
Programming with Applications to Chemical Engineering Problems, I &
EC Process Design and Development Quarterly 8 (1969), 496-501
10. P.D. Robers and A. B-I, An Interval Programming
Algorithm for Discrete L1 Approximation Problems, J.
Approximation Th. 2 (1969), 323-336
11. A. B-I, A. Charnes, A.P. Hurter and P.D. Robers, On
the Explicit Solution of a Special Class of Linear Economic Models, Oper.
Res. 18 (1970), 462-479
12. R.A. Abrams and A. B-I, A Duality Theorem for
Complex Quadratic Programming, J. Optimiz. Th. Appl. 4
(1969), 244-152
13. A. B-I and M.J.L. Kirby, A Characterization of
Equilibrium Points of Bimatrix Games, Atti Accad Naz. Lincei Rend. Cl.
Sci. Fis. Mat. Natur. (8) 46
(1969), 196-201
14. A. B-I, A. Charnes and M.J.L. Kirby, On
Stochastic Linear Approximation Problems, Oper. Res. 18
(1970), 555-558
15. R.A. Abrams and A. B-I, On the Key Theorems of
Tucker and Levinson for Complex Linear Inequalities, J. Math. Anal.
Appl. 29 (1970), 640-646
16. P.D. Robers and A. B-I, A Decomposition Method
for Interval Linear Programming, Management Sci. 16 (1970),
374-387
17. P.D. Robers and A. B-I, A Suboptimization
Method for Interval Linear Programming, Lin. Algeb.Appl. 3
(1970), 384-405
18. S. Zlobec and A. B-I, On Explicit Solutions of
Interval Linear Programs, Israel J. Math. 8 (1970), 12-22
19. A. Berman and A. B-I, More on Linear
Inequalities with Applications to Matrix Theory, J. Math. Th. Appl. 33
(1971), 482-496
20. A. Berman and A. B-I, Linear Inequalities,
Mathematical Programming and Matrix Theory, Math. Programming 1(1971),
291-300
21. A. B-I, A. Charnes and K.O. Kortanek, Asymptotic
Duality over Closed Convex Cones, J. Math. Anal. Appl. 35
(1971), 677-690
22. A. B-I, A. Charnes and K.O. Kortanek, Asymptotic
Duality in Semi-Infinite Programming and the Convex Core Topology, Rendiconti
di Matematica 4 (1971),
751-767
23. A. B-I, Complex Linear Inequalities, pp.
23-38 in Inequalities III: Proceedings of the 3rd Symposium on Inequalities
(O. Shisha, Editor), Academic Press, New York, 1972, xxii + 367 pp.
24. A. Berman and A. Ben-Israel, Linear Equations
over Cones with Interior: A Solvability Theorem with Applications to Matrix
Theory, Lin. Algeb. Appl. 7 (1973), 139-149
25. S. Zlobec and A. B-I, Explicit Solutions of Interval
Linear Programs, Oper. Res. 21 (1973), 390-393
26. A. B-I, A Z-Simplex Algorithm with Partial
Updates, BIT 27 (1987), 50-61
27. A. B-I, Canonical Bases in Linear Programming,
Lin. Algeb. Appl. 102 (1988), 95-119
28. A. B-I and S.D. Flåm, Support Prices of Activities in Linear Programming,
Optimization 20 (1989), 561-579
29. H. Wolkowicz and A. B-I, A Recursive, Volume
Reducing Algorithm for Semi-Infinite Linear Programming, pp. 479-490 in Systems
and Management Science by Extremal Methods. Research Honoring Abraham Charnes
at Age 70 (F.Y. Phillips and J.J. Rousseau, Editors), Kluwer Academic
Publishers, 1992