Contributed Papers

Journal of Optimization Theory and Applications

, Volume 86, Issue 2, pp 491-500

First online:

Optimality and duality with generalized convexity

  • N. G. RuedaAffiliated withDepartment of Mathematics and Computer Science, Merrimack College
  • , M. A. HansonAffiliated withDepartment of Statistics, Florida State University
  • , C. SinghAffiliated withDepartment of Mathematics, St. Lawrence University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given.

Key Words

Generalized convexity duality fractional programming multiobjective programming minmax programming