Results 231 to 240 of about 2,325 (266)
Some of the next articles are maybe not open access.
A note on higher-order symmetric duality
Applied Mathematics and Computation, 2013In this paper, a pair of Wolfe type higher-order symmetric dual multiobjective programs is formulated. Strong and converse duality theorems are established under invexity assumptions. Duality relations for Mond-Weir type dual models have also been obtained under pseudoinvexity assumptions.
T. R. Gulati 0001, Khushboo Verma
openaire +1 more source
On Mixed Symmetric Duality in Mathematical Programming
OPSEARCH, 1999A new symmetric dual formulation, called the mixed symmetric dual, is presented for a class of nonlinear programming problems and various duality theorems are established. This mixed formulation unifies the two existing and well known symmetric dual formulations in the literature.
Chandra, S., Husain, I., Abha
openaire +1 more source
On Mixed Symmetric Duality in Multiobjective Programming
OPSEARCH, 1999A new symmetric dual formulation, called the mixed symmetric dual, is presented for a class of nonlilnear multiobjective programming problems and various duality theorems are established. This mixed dual formulation unifies the two existing symmetric dual formulations in the literature.
Bector, C. R., Chandra, Suresh, Abha
openaire +1 more source
Il Nuovo Cimento A, 1970
A symmetrical formula for the on-mass-shell three-particle vertex of the generalized Veneziano model is derived. No attempt is made to isolate the contributions corresponding to the different angularmomentum components of the three particles.
openaire +1 more source
A symmetrical formula for the on-mass-shell three-particle vertex of the generalized Veneziano model is derived. No attempt is made to isolate the contributions corresponding to the different angularmomentum components of the three particles.
openaire +1 more source
Symmetric duality for minimax variational problems
Mathematical Methods of Operations Research, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
T. R. Gulati 0001 +2 more
openaire +1 more source
DRIFT TRANSFORMATIONS OF SYMMETRIC DIFFUSIONS, AND DUALITY
Infinite Dimensional Analysis, Quantum Probability and Related Topics, 2007Starting with a symmetric Markov diffusion process X (with symmetry measure m and L2 (m) infinitesimal generator A) and a suitable core [Formula: see text] for the Dirichlet form of X, we describe a class of derivations defined on [Formula: see text].
openaire +1 more source
Trace and Duality in Symmetric Monoidal Categories
K-Theory, 2005For a symmetric monoidal category \(\mathcal C\) with a realization functor for simplicial objects in it, we can take any monoid \(R\) in \(\mathcal C\) and any \(R\)-bimodule \(E\), and construct and then realize the Hochschild complex of \(R\) in \(E\).
openaire +1 more source
Symmetric Duality for Continuous Linear Programs
SIAM Journal on Applied Mathematics, 1970A strong duality theorem for continuous linear programs is established and a two-level maximal principle derived as a consequence. The method of proof is constructive, indicating that optimal solutions of approximating linear programs converge to the optimal solution of the continuous problem.
openaire +2 more sources
1985
In deriving our results concerning infinite vector series [3], R. G. Jeroslow and I discovered a new framework for certain infinitely constrained problems which results in a symmetric primal-dual pair of programs. This pairing subsumes the standard primal-dual pair of linear programming, semi-infinite programming and even finite convex programming.
openaire +1 more source
In deriving our results concerning infinite vector series [3], R. G. Jeroslow and I discovered a new framework for certain infinitely constrained problems which results in a symmetric primal-dual pair of programs. This pairing subsumes the standard primal-dual pair of linear programming, semi-infinite programming and even finite convex programming.
openaire +1 more source
Nondifferentiable Symmetric and Self Duality in Fractional Programming
OPSEARCH, 2002A pair of symmetric dual nondifferentiable fractional programming problem is formulated in which both the numerator and denominator of the objective function contain a term of the support function of a compact convex set. For this pair, weak and strong duality theorems are established under convexity-concavity of the numerator and concavity — convexity
Husain, I., Goyal, Abha
openaire +2 more sources

