Abstract
This paper deals with the conditions for the uniqueness of the optimal solution of an optimization problem for which the objective function is linear and the feasible set is a closed convex set in a finite-dimensional space. Some of these conditions, such as strong unicity andw-unicity (a new transition concept), involve only the feasible set. Others are related to the properties of the chosen linear representation. To some extent, the paper surveys the literature about unicity and strong unicity in linear semi-infinite programming.
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
