A note on a class of equilibrium problems with equilibrium constraints
نویسنده
چکیده
The behaviour of firms on an oligopolistic market is usually modeled via the CournotNash equilibrium concept ([13, 18]). In fact, it is the classical Nash equilibrium, where each player (firm) maximizes its profit subject to production constraints. Assuming that one from the firms has a temporal advantage over the others, this firm can increase its profit by replacing a Cournot-Nash strategy by a Stackelberg stratgy ([6, 17, 18]). This firm (called Leader) computes its new strategy under the assumption that the remaining firms (Followers) will share the rest of the market again in the noncooperative way. One obtains a bilevel structure with a CournotNash equilibrium (parametrized by the Leader's strategy) on the lower level. To compute the Leader's strategy, one has thus to solve a so-called mathematical program with equilibrium constraints (MPEC) ([8]). It might happen, however, that the standard Cournot-Nash strategy is simultaneously deserted by two or more firms. In such a case each of them has to make some assumptions not only about the behaviour of the Followers, but also about the behaviour of the remaining Leaders. Concerning this behaviour, two "extreme" situations can be distinguished:
منابع مشابه
Slope Stability Analysis Using A Non-linear Optimization Technique (RESEARCH NOTE)
In this study, a limit equilibrium method has been developed that satisfies all conditions of equilibrium and assumes circular slip surfaces. All force and moment equilibrium equations are employed without using simplification assumptions. A non-linear optimization technique is used to solve the system of equations with the corresponding constraints. The proposed method is capable to determine ...
متن کاملA Collocation Method with Modified Equilibrium on Line Method for Imposition of Neumann and Robin Boundary Conditions in Acoustics (TECHNICAL NOTE)
A collocation method with the modified equilibrium on line method (ELM) forimposition of Neumann and Robin boundary conditions is presented for solving the two-dimensionalacoustical problems. In the modified ELM, the governing equations are integrated over the lines onthe Neumann (Robin) boundary instead of the Neumann (Robin) boundary condition equations. Inother words, integration domains are...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملA Note on Smoothing Mathematical Programs with Equilibrium Constraints
Mathematical programs with equilibrium constrains (MPECs) in which the constraints are defined by a parametric variational inequality are considered. Recently, nonlinear programming solvers have been used to solve MPECs. Smoothing algorithms have been very successful. In this note, a smoothing approach based on neural network function to solve MPECs is proposed. The performance of the proposed ...
متن کاملEstimation of Concentrations in Chemical Systems at Equilibrium Using Geometric Programming
Geometric programming is a mathematical technique, which has been developed for nonlinear optimization problems. This technique is based on the dual program with linear constraints. Determination of species concentrations in chemical equilibrium conditions is one of its applications in chemistry and chemical engineering fields. In this paper, the principles of geometric programming and its comp...
متن کاملAn efficient one-layer recurrent neural network for solving a class of nonsmooth optimization problems
Constrained optimization problems have a wide range of applications in science, economics, and engineering. In this paper, a neural network model is proposed to solve a class of nonsmooth constrained optimization problems with a nonsmooth convex objective function subject to nonlinear inequality and affine equality constraints. It is a one-layer non-penalty recurrent neural network based on the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Kybernetika
دوره 40 شماره
صفحات -
تاریخ انتشار 2004