- 期刊
LINEAR PROGRAMMING WITH POSITIVE SEMI-DEFINITE MATRICES
摘要
We consider the general linear programming problem over the cone of positive semi-definite matrices. We first provide a simple sufficient condition for existence of optimal solutions and absence of a duality gap without requiring existence of a strictly feasible solution. We then simply characterize the analogues of the standard concepts of linear programming, i.e., extreme points, basis, reduced cost, degeneracy, pivoting step as well as a Simplex-like algorithm.
延伸閱讀
- Putcha, M. S. (1981). ON LINEAR ALGEBRAIC SEMIGROUPS III. International Journal of Mathematics and Mathematical Sciences, 1981(), 667-690. https://doi.org/10.1155/S0161171281000513
- Altinisik, E., Tuglu, N., & Haukkanen, P. (2007). Determinant and Inverse of Meet and Join Matrices. International Journal of Mathematics and Mathematical Sciences, 2007(), 373-383. https://doi.org/10.1155/2007/37580
- Liu, Z., Xu, Y., Wang, K., & Xu, C. (2014). Extremal Inverse Eigenvalue Problem for a Special Kind of Matrices. Journal of Applied Mathematics, 2014(), 563-569-462. https://doi.org/10.1155/2014/513513
- DOMINICI, D. (2006). ASYMPTOTIC ANALYSIS OF POWERS OF MATRICES. International Journal of Mathematics and Mathematical Sciences, 2006(), 1285-1296-189. https://doi.org/10.1155/IJMMS/2006/79617
- Mullen, G. L. (1981). PERMUTATION MATRICES AND MATRIX EQUIVALENCE OVER A FINITE FIELD. International Journal of Mathematics and Mathematical Sciences, 1981(), 503-512. https://doi.org/10.1155/S0161171281000367