Key points are not available for this paper at this time.
Abstract The aim of this paper is to study optimality conditions for differentiable linearly constrained pseudoconvex programs. The stated results are based on new transversality conditions which can be used instead of complementarity ones. Necessary and sufficient optimality conditions are stated under suitable generalized convexity properties. Moreover, two different pairs of dual problems are proposed and weak and strong duality results proved. Finally, it is shown how transversality conditions can be applied to characterize optimality of convex quadratic problems and to efficiently solve a particular class of Max-Min problems
Cambini et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: