Normally, if a possible Resolution exists and Should the constraint established is bounded, then the the best possible value is always attained within the boundary on the constraint set, by the most principle for convex capabilities (alternatively, via the least principle for concave features) since linear capabilities are both convex https://reidspfnn.ltfblog.com/27704191/a-secret-weapon-for-hire-someone-to-do-linear-programming-homework