Abstract
We consider a minmax programming problem involving several generalized B-vex n-set functions. Some optimality results and Wolfe type duality theorems are given. As a special case, an n-set generalized minmax fractional programming problem is considered
Author information
Contact details are reproduced from the original publication and may be historical.
Vasile Preda
Faculty of Mathematics, University of Bucharest, Str. Academiei nr. 14, 70109 Bucharest, Romania
Anton Bătătorescu
Faculty of Mathematics, University of Bucharest, Str. Academiei nr. 14, 70109 Bucharest, Romania
Suggested citation
V. Preda, A. Bătătorescu. “On Duality for Minmax Generalized B-vex Programming Involving n-Set Functions.” Journal of Convex Analysis 9 (2002), No. 2, 609–623. https://doi.org/10.68381/jca09036
Published by Heldermann Verlag, 2002. Rights now held by Banach Press.
Vasile Preda
