An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions

DOI10.1016/j.jmaa.2005.08.009zbMath1140.90048OpenAlexW1975499724MaRDI QIDQ819669

Tadeusz Antczak

Publication date: 29 March 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.08.009

zbMATH Keywords

duality\(\eta \)-approximated Mond-Weir dual problem\(\eta \)-approximated optimization problem\(r\)-invex function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15) Convexity of real functions in one variable, generalizations (26A51) Convexity of real functions of several variables, generalizations (26B25)

Related Items (3)

Multiobjective optimization problems with modified objective functions and cone constraints and applications ⋮ Sufficient Conditions for Nonsmoothr-Invexity ⋮ Exponential type duality for η-approximated variational problems

Cites Work

• On various duality theorems in nonlinear programming
• Sufficient optimality conditions and duality for a quasiconvex programming problem
• On sufficiency of the Kuhn-Tucker conditions
• A new approach to multiobjective programming with a modified objective function
• A new method of solving nonlinear mathematical programming problems involving \(r\)-invex functions
• A duality theorem for non-linear programming
• An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions