๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Stochastic mathematical programs with hybrid equilibrium constraints

โœ Scribed by Yong-Chao Liu; Jin Zhang; Gui-Hua Lin


Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
312 KB
Volume
235
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper considers a stochastic mathematical program with hybrid equilibrium constraints (SMPHEC), which includes either ''here-and-now'' or ''wait-and-see'' type complementarity constraints. An example is given to describe the necessity to study SMPHEC. In order to solve the problem, the sampling average approximation techniques are employed to approximate the expectations and smoothing and penalty techniques are used to deal with the complementarity constraints. Limiting behaviors of the proposed approach are discussed. Preliminary numerical experiments show that the proposed approach is applicable.


๐Ÿ“œ SIMILAR VOLUMES


Solving mathematical programs with fuzzy
โœ Cheng-Feng Hu; Fung-Bao Liu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 520 KB

This work deals with mathematical programs with fuzzy equilibrium constraints. It shows that solving the fuzzy MPEC is equivalent to solving a fuzzy complementarity constrained optimization problem. By using the tolerance approach, we show that the fuzzy complementarity constrained optimization prob

Further investigation on feasibility of
โœ Zhong Wan ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 231 KB

In this paper, we present feasibility conditions for mathematical programs with affine equilibrium constraints (MPECs) where additional joint constraints are present that must be satisfied by the state and design variables of the problems. We show that these conditions are also sufficient for quadra

Modified relaxation method for mathemati
โœ Gui-Hua Lin ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 167 KB

## Abstract In this paper, we suggest a new relaxation method for solving mathematical programs with complementarity constraints. This method can be regarded as a modification of a method proposed in a recent paper (__J. Opt. Theory Appl.__ 2003; **118**:81โ€“116). We show that the main results remai