1. Production Theory for Constrained Linear Activity Models 

Abstract, citation details and access to published version available at: https://drive.google.com/file/d/1-3RbNNGi2pxa7VV6fVc4-clVd5vFltQB/view?usp=sharing 

2. von-Neumann's Price Theory for Bi-matrix Constrained Linear Activity Models

3. Exact Solution Procedure for the Log-linear Continuous Knapsack Problem

4. "Greedy Type Algorithms" for The Continuous Linear Multiple Choice Knapsack Problem 

5. The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization

6. Dynamic Concave-Linear Optimization

7. The rank theorem for matrices via the weak duality theorem of linear programming

8. Continuity in Parametric Linear Programming

9. Linear programming with vector coefficients in the constraints

10. A Note on Golikov and Evtushenko (2002)

11. Local Linearity of optimal value function in Linear Programming

12. A Deterministic and Linear Model of Dynamic Optimization

13. Linear Models of Dynamic Optimization with Linear Constraints

14. A Linear Model of Optimal Control with One-dimensional Control and State Variables

15. Two-Person Additively-Separable Sum Games

16. Existence of Symmetric Equilibrium for Two-Person Symmetric Equal Row-Sums Games

17. Completely Mixed Bi-matrix Games Without Restrictions on Payoffs at Equilibrium

18. Pure-Strategy Equilibrium for Bi-matrix Games and Coordination Games

19. Equivalence Theorem for Simple Coordination Games

20. Linear Programming Problems Representing Dorfman’s Model of Monopoly

21. Additively Seprable Partially Zero-Sum Bi-matrix Games

22. The Value of Two-Person Additively-Separable Sum Games

23. A Two-Period Stochastic Linear Programming Game

24. The Max-max Linear Programming Problem

25. Additively-Separable Sum Linear Programming Games