Duality for a class of nondifferentiable multiobjective programming problems (Q1840559): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Yang, Xinmin / rank
 
Normal rank
Property / author
 
Property / author: Kok Lay Teo / rank
 
Normal rank
Property / author
 
Property / author: Xiao Qi Yang / rank
 
Normal rank

Revision as of 21:48, 9 February 2024

scientific article
Language Label Description Also known as
English
Duality for a class of nondifferentiable multiobjective programming problems
scientific article

    Statements

    Duality for a class of nondifferentiable multiobjective programming problems (English)
    0 references
    23 October 2001
    0 references
    In a recent paper written by \textit{B. Mond} and \textit{Schechter} nondifferentiable symmetric duality in which the objective function contained a support function has been studied. In the paper under review the authors replace the objective function by a more general function -- the support function of a compact convex set. A general model for a class of nondifferentiable multiobjective programs is formulated and weak duality theorems under weak convexity conditions are formulated and proved. The special case of the support function as the square root of a positive semidefinite quadratic form is considered.
    0 references
    nondifferentiable multiobjective programs
    0 references
    weak duality theorems
    0 references
    weak convexity conditions
    0 references
    support function
    0 references
    0 references
    0 references
    0 references

    Identifiers