This topic is to investigate nonemptiness and boundedness of the solution set for some optimization problems with the weaker strict feasibility in reflexive Banach spaces. As a novel notation, the relaxed strict feasibility for a optimization problem is introduced. Moreover, it is proved that a pseudomonotone optimization problem has a nonempty and bounded solution set provided that it is relaxed strict feasibility in reflexive Banach spaces.