Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.
Agarwal, Ravi P., Ahmad, Izhar, Gupta, S.K., Kailey, N. (2011)
Abstract and Applied Analysis
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Symmetric duality for a class of multiobjective programming.”
Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.
Optimality Conditions and Duality in Multiobjective Programming With -Invexity
Massimiliano Ferrara, Maria Viorica Stefanescu (2008)
The Yugoslav Journal of Operations Research
Similarity:
Duality in vector optimization. I. Abstract duality scheme
Tran Quoc Chien (1984)
Kybernetika
Similarity:
Duality theorems for a class of non-linear programming problems.
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
Perturbation theory of duality in vector optimization via the abstract duality scheme
Tran Quoc Chien (1987)
Kybernetika
Similarity:
Unified duality for vector optimization problem over cones involving support functions
Surjeet Kaur Suneja, Pooja Louhan (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we give necessary and sufficient optimality conditions for a vector optimization problem over cones involving support functions in objective as well as constraints, using cone-convex and other related functions. We also associate a unified dual to the primal problem and establish weak, strong and converse duality results. A number of previously studied problems appear as special cases.
Unification of the abstract duality scheme
Tran Quoc Chien (1987)
Kybernetika
Similarity:
A Gradient-Type Method for the Equilibrium Programming Problem With Coupled Constraints
Anatoly Antipin (2000)
The Yugoslav Journal of Operations Research
Similarity:
Duality for Multiobjective Fractional Programming Problems Involving -Type-I -Set -Functions
I.M. Stancu-Minasian, Gheorghe Dogaru, Andreea Mădălina Stancu (2009)
The Yugoslav Journal of Operations Research
Similarity:
Characterizations of ɛ-duality gap statements for constrained optimization problems
Horaţiu-Vasile Boncea, Sorin-Mihai Grad (2013)
Open Mathematics
Similarity:
In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.