On sufficiency for mathematical programming problems with equilibrium constraints

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2013 English Publisher:National Library of SerbiaJournal:Yugoslav Journal of Operations Research, volume 23, pages 173-182 (issn: 0354-0243, eissn: 1820-743X,

Copyright policy )

Authors: Mishra S.K.; Pandey Yogendra;

doi: 10.2298/yjor130207021m

On sufficiency for mathematical programming problems with equilibrium constraints

- Summary
- Subjects
- Metrics

Abstract

In this paper, we consider a mathematical programming with equilibrium constraints (MPEC) where the objective and constraint functions are continuously differentiable. We establish the sufficient optimality condition for strict local minima of order m under the assumptions of generalized strong convexity of order m.

Keywords

T58.6-58.62, sufficient optimality condition, Management information systems, higher-order strong convexity, mathematical programming with equilibrium constraint

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average

Found an issue? Give us feedback

2

Average

Published in a Diamond OA journal

Fields of Science (3) View all

Fields of Science