Abstract
In this paper, using Moore–Penrose inverse, we characterize the feasibility of primal and dual Stein linear programs over symmetric cones in a Euclidean Jordan algebra V. We give sufficient conditions for the solvability of the Stein linear programming problem. Further, we give a characterization of the globally uniquely solvable property for the Stein transformation in terms of a least element of a set in V in the context of the linear complementarity problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
