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:
Displaying similar documents to “A Gradient-Type Method for the Equilibrium Programming Problem With Coupled Constraints”
Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.
Symmetric duality for a class of multiobjective programming.
Yang, Xinmin, Wang, Shouyanc, Li, Duan (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Reformulations in Mathematical Programming: Definitions and Systematics
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
Second order convexity and a modified objective function method in mathematical programming
Tadeusz Antczak (2007)
Control and Cybernetics
Similarity:
A note on a class of equilibrium problems with equilibrium constraints
Jiří V. Outrata (2004)
Kybernetika
Similarity:
The paper concerns a two-level hierarchical game, where the players on each level behave noncooperatively. In this way one can model eg an oligopolistic market with several large and several small firms. We derive two types of necessary conditions for a solution of this game and discuss briefly the possibilities of its computation.