Int. J. Simul. Multidisci. Des. Optim.
Volume 10, 2019
|Number of page(s)||7|
|Published online||07 June 2019|
Modified Courant-Beltrami penalty function and a duality gap for invex optimization problem
School of Mathematical Sciences,
Main Campus, USM,
2 Department of Mathematics, Yusuf Maitama Sule University, Kano, 700241 Kabuga, Kano, Nigeria
* e-mail: firstname.lastname@example.org
Accepted: 13 May 2019
In this paper, we modified a Courant-Beltrami penalty function method for constrained optimization problem to study a duality for convex nonlinear mathematical programming problems. Karush-Kuhn-Tucker (KKT) optimality conditions for the penalized problem has been used to derived KKT multiplier based on the imposed additional hypotheses on the constraint function g. A zero-duality gap between an optimization problem constituted by invex functions with respect to the same function η and their Lagrangian dual problems has also been established. The examples have been provided to illustrate and proved the result for the broader class of convex functions, termed invex functions.
Key words: Courant-Beltrami penalty function / penalized problem / Lagrangian dual
© M. Hassan and A. Baharum, published by EDP Sciences, 2019
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.