2013•International Journal of Mathematical AnalysisOpen access

A study on the duality of e-convex non-linear programming problem

Abd El-Monem A. Megahed, Hebaa G Gomma, Ebrahim A. Youness, Abou-Zaid H. El-Banna

Abstract

In this work, we will study a class of the duality problem of E-convex programming. The weak and strong theorems for the duality problem of E-convex programming are given to show the relation between the solutions of the dual and primal problems, and also we will prove some properties of the duality problem of E-convex programming.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Duality (order theory), Mathematics, Perturbation function, Convex optimization, Strong duality, Duality gap, Nonlinear programming, Wolfe duality