Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Higher-order Mond-Weir converse duality in multiobjective programming involving cones

    Access Status
    Fulltext not available
    Authors
    Yang, Xinmin
    Yang, Jin
    Yip, Tsz Leung
    Teo, Kok Lay
    Date
    2013
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Yang, Xinmin and Yang, Jin and Yip, Tsz Leung and Teo, Kok Lay. 2013. Higher-order Mond-Weir converse duality in multiobjective programming involving cones. Science China: Mathematics. 56 (11): pp. 2389-2392.
    Source Title
    Science China: Mathematics
    DOI
    10.1007/s11425-013-4700-3
    ISSN
    1674-7283
    URI
    http://hdl.handle.net/20.500.11937/8637
    Collection
    • Curtin Research Publications
    Abstract

    In this work, we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in multiobjective programming with cone constraints. Optimization, 2010, 59: 29–43].

    Related items

    Showing items related by title, author, creator and subject.

    • Global optimization for nonconvex optimization problems
      Ruan, Ning (2012)
      Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality ...
    • Optimisation of large scale network problems
      Grigoleit, Mark Ted (2008)
      The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
    • Multiobjective second-order symmetric duality with F -convexity
      Yang, X.; Yang, X.; Teo, Kok Lay; Hou, S. (2005)
      We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F-convexity ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.