On Mixed Symmetric Duality in Mathematical Programming

OPSEARCH ◽  
1999 ◽  
Vol 36 (2) ◽  
pp. 165-171 ◽  
Author(s):  
S. Chandra ◽  
I. Husain ◽  
Abha
Keyword(s):  
Mathematical Programming ◽  
Symmetric Duality

scholarly journals Symmetric duality in complex spaces over cones

2021 ◽  
pp. 4-4
Author(s):  
Izhar Ahmad ◽  
Divya Agarwal ◽  
Kumar Gupta
Keyword(s):  
Mathematical Programming ◽  
Duality Theory ◽  
Optimization Theory ◽  
Second Order ◽  
Symmetric Duality ◽  
Polyhedral Cones ◽  
Complex Spaces ◽  
Duality Results ◽  
Duality Relations

Duality theory plays an important role in optimization theory. It has been extensively used for many theoretical and computational problems in mathematical programming. In this paper duality results are established for first and second order Wolfe and Mond-Weir type symmetric dual programs over general polyhedral cones in complex spaces. Corresponding duality relations for nondifferentiable case are also stated. This work will also remove inconsistencies in the earlier work from the literature.

Characterizations of optimality for continuous convex mathematical programs. Part I. Linear constraints

1979 ◽  
Vol 21 (1) ◽  
pp. 37-44 ◽  
Author(s):  
C. H. Scott ◽  
T. R. Jefferson
Keyword(s):  
Mathematical Programming ◽  
Duality Theory ◽  
Linear Constraints ◽  
Lagrangian Formalism ◽  
Symmetric Duality ◽  
Mathematical Programs ◽  
Convex Functionals ◽  
Mathematical Programming Problems

AbstractRecently we have developed a completely symmetric duality theory for mathematical programming problems involving convex functionals. Here we set our theory within the framework of a Lagrangian formalism which is significantly different to the conventional Lagrangian. This allows various new characterizations of optimality.

scholarly journals Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming

2011 ◽  
Vol 2011 ◽  
pp. 1-14 ◽  
Author(s):  
Ravi P. Agarwal ◽  
Izhar Ahmad ◽  
S. K. Gupta ◽  
N. Kailey
Keyword(s):  
Mathematical Programming ◽  
Second Order ◽  
Duality Theorems ◽  
Symmetric Duality ◽  
Converse Duality ◽  
Nondifferentiable Functions

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-orderF-convexity/pseudoconvexity assumptions.

Sign in / Sign up

Export Citation Format

Share Document