Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
This paper is concerned with a pair of second-order mixed symmetric dual programs involving nondifferentiable functions. Weak, strong, and converse duality theorems are proved for aforementioned pair using the notion of second-order F-convexity/pseudoconvexity assumptions.
Saved in:
Main Authors: | Ravi P. Agarwal, Izhar Ahmad, S. K. Gupta, N. Kailey |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2011-01-01
|
Series: | Abstract and Applied Analysis |
Online Access: | http://dx.doi.org/10.1155/2011/103597 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Lagrangian Duality for Multiobjective Programming Problems in Lexicographic Order
by: X. F. Hu, et al.
Published: (2013-01-01) -
New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem
by: Yi-Chou Chen, et al.
Published: (2013-01-01) -
Mixed-type duality approach for interval-valued programming problems with vanishing constraints
by: Vivek Singh, et al.
Published: (2025-03-01) -
Duality of (h,φ)-Multiobjective Programming Involving Generalized Invex Functions
by: GuoLin Yu
Published: (2012-01-01) -
Non-homogeneous BVPs for second-order symmetric Hamiltonian systems
by: Chen Yingying, et al.
Published: (2024-12-01)