Displaying similar documents to “A Gradient-Type Method for the Equilibrium Programming Problem With Coupled Constraints”

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...

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.

Fast computation of the leastcore and prenucleolus of cooperative games

Joseph Frédéric Bonnans, Matthieu André (2008)

RAIRO - Operations Research

Similarity:

The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among players. It has, however, the drawback being a linear programming problem with 2 - 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially...