Approximate values for mathematical programs with variational inequality constraints

M. Lignola () and Jacqueline Morgan

Computational Optimization and Applications, 2012, vol. 53, issue 2, 485-503

Abstract: In general the infimal value of a mathematical program with variational inequality constraints (MPVI) is not stable under perturbations in the sense that the sequence of infimal values for the perturbed programs may not converge to the infimal value of the original problem even in presence of nice data. Thus, for these programs we consider different types of values which approximate the exact value from below or/and from above under or without perturbations. Copyright Springer Science+Business Media, LLC 2012

Keywords: Mathematical program; Bilevel problem; Variational inequality; Infimal value; Approximate solution; Perturbation (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-012-9470-2 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:53:y:2012:i:2:p:485-503

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-012-9470-2

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().