Skip to main navigation Skip to search Skip to main content

Mixed symmetric duality in non-differentiable multiobjective mathematical programming

S. K. Mishra, S. Y. Wang, K. K. Lai, F. M. Yang

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    Abstract

    Two mixed symmetric dual models for a class of non-differentiable multiobjective nonlinear programming problems with multiple arguments are introduced in this paper. These two mixed symmetric dual models unify the four existing multiobjective symmetric dual models in the literature. Weak and strong duality theorems are established for these models under some mild assumptions of generalized convexity. Several special cases are also obtained. © 2006 Elsevier B.V. All rights reserved.
    Original languageEnglish
    Pages (from-to)1-9
    JournalEuropean Journal of Operational Research
    Volume181
    Issue number1
    DOIs
    Publication statusPublished - 16 Aug 2007

    Research Keywords

    • Generalized convexity
    • Non-differentiable nonlinear programming
    • Support function
    • Symmetric duality

    Fingerprint

    Dive into the research topics of 'Mixed symmetric duality in non-differentiable multiobjective mathematical programming'. Together they form a unique fingerprint.

    Cite this