Abstract We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical programming problems. We pay special attention in the case that the functional constraint belongs to a specific class of generalized convex functions known as strongly quasiconvex functions. After analyzing a specialized subdifferential, named the strong subdifferential, we compute the normal cone of the supremum function in terms of such subdifferentials, and apply this result to the mathematical programming problem. We illustrate our important results by examples.
Lara et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: