Duality for generalized problems in complex programming
D. G. Mahajan, Manohar Narhar Vartak · Bulletin of the Australian Mathematical Society · 1976
Weak duality and direct duality theorems are proved, under appropriate assumptions, for the following pair of programming problems in complex space: The objective function may be nondifferentiable and the constraints are of a more general nature than those considered earlier by various authors. Several well-known results are shown to be special cases of the results proved here.