Journal of Optimization Theory and Applications

, Volume 86, Issue 2, pp 491–500

Optimality and duality with generalized convexity

  • N. G. Rueda
  • M. A. Hanson
  • C. Singh
Contributed Papers

Abstract

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Plenum Publishing Corporation 1995

Authors and Affiliations

  • N. G. Rueda
    • 1
  • M. A. Hanson
    • 2
  • C. Singh
    • 3
  1. 1.Department of Mathematics and Computer ScienceMerrimack CollegeNorth Andover
  2. 2.Department of StatisticsFlorida State UniversityTallahassee
  3. 3.Department of MathematicsSt. Lawrence UniversityCanton

Personalised recommendations