We consider the class of nonseparable mathematical programs in which the vector variable can be partitioned into a number of subvectors corresponding to independent constraint sets, as opposed to two such subvectors considered in an earlier paper by Wendell and Hurter (W-H). Several optimality conditions previously given by W-H are extended to this more general case.
No takes yet. Share an insight, caveat, or question.
Wendell et al. (1980) studied this question.