An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions
type: Item
instance of: scholarly article
title: An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions
zbMATH Open document ID: 1140.90048
published in: Journal of Mathematical Analysis and Applications
publication date: 2006-03-29T00:00:00Z
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 26A51
Mathematics Subject Classification ID: 26B25
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 5016148
zbMATH Keywords: \(\eta \)-approximated optimization problem
zbMATH Keywords: \(\eta \)-approximated Mond-Weir dual problem
zbMATH Keywords: \(r\)-invex function
zbMATH Keywords: duality
author: Tadeusz Antczak
MaRDI profile type: Publication
full work available at URL: j.jmaa.2005.08.009
OpenAlex ID: W1975499724
cites work: A new approach to multiobjective programming with a modified objective function
cites work: An η-Approximation Approach for Nonlinear Mathematical Programming Problems Involving Invex Functions
cites work: A new method of solving nonlinear mathematical programming problems involving \(r\)-invex functions
cites work: On various duality theorems in nonlinear programming
cites work: Sufficient optimality conditions and duality for a quasiconvex programming problem
cites work: Q3318567
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Q5589748
cites work: Q3325486
cites work: A duality theorem for non-linear programming
DOI: 10.1016/J.JMAA.2005.08.009
description: scientific article; zbMATH DE number 5016148