Lagrange Duality and Saddle Point Optimality Conditions for Semi-InfiniteN Mathematical Programming Problems with Equilibrium Constraints

  • S. K. Mishra Department of Mathematics, Institute of Science, Banaras Hindu University Varanasi-221005, India

Abstract

In this paper, we consider a special class of optimization problem which contains innitely many inequality constraints and nitely many complementarity constraints known as the semi-innite mathematical programming problem with equilibrium constraints (SIMPEC). We propose Lagrange type dual model for the SIMPEC and obtain their duality results using convexity assumptions. Further, we discuss the saddle point optimality conditions for the SIMPEC. Some examples are given to illustrate the
obtained results.

Published
2019-06-19
How to Cite
MISHRA, S. K.. Lagrange Duality and Saddle Point Optimality Conditions for Semi-InfiniteN Mathematical Programming Problems with Equilibrium Constraints. Yugoslav Journal of Operations Research, [S.l.], v. 29, n. 4, p. 433–448, june 2019. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/708>. Date accessed: 22 nov. 2024.
Citation Formats
Issue
Vol 29 No 4 (2019)
Section
Articles
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.