Sufficiency and duality in multiobjective programming with generalized (F, ρ)-convexity

I. Ahmad

doi:10.1515/JAA.2005.19

Sufficiency and duality in multiobjective programming with generalized (F, ρ)-convexity

I. Ahmad^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond-Weir type dual relating properly efficient solutions of the primal and dual problems.

Original language	English
Pages (from-to)	19-33
Number of pages	15
Journal	Journal of Applied Analysis
Volume	11
Issue number	1
DOIs	https://doi.org/10.1515/JAA.2005.19
State	Published - Jun 2005
Externally published	Yes

Bibliographical note

Funding Information:
duality; generalized convexity. Key words and phrases. 90C29, 90C30, 90C46. Research is partially supported by Aligarh Muslim University, Aligarh, under Minor Research Project No/Admin/826/AA/2002.

Keywords

90C29
90C30
90C46

ASJC Scopus subject areas

Mathematical Physics
Statistics, Probability and Uncertainty
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1515/JAA.2005.19

Cite this

@article{dba781d72e1f40dbba56d9987a9822e7,

title = "Sufficiency and duality in multiobjective programming with generalized (F, ρ)-convexity",

abstract = "A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond-Weir type dual relating properly efficient solutions of the primal and dual problems.",

keywords = "90C29, 90C30, 90C46",

author = "I. Ahmad",

note = "Funding Information: duality; generalized convexity. Key words and phrases. 90C29, 90C30, 90C46. Research is partially supported by Aligarh Muslim University, Aligarh, under Minor Research Project No/Admin/826/AA/2002.",

year = "2005",

month = jun,

doi = "10.1515/JAA.2005.19",

language = "English",

volume = "11",

pages = "19--33",

journal = "Journal of Applied Analysis",

issn = "1425-6908",

publisher = "Walter de Gruyter GmbH",

number = "1",

}

TY - JOUR

T1 - Sufficiency and duality in multiobjective programming with generalized (F, ρ)-convexity

AU - Ahmad, I.

N1 - Funding Information: duality; generalized convexity. Key words and phrases. 90C29, 90C30, 90C46. Research is partially supported by Aligarh Muslim University, Aligarh, under Minor Research Project No/Admin/826/AA/2002.

PY - 2005/6

Y1 - 2005/6

N2 - A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond-Weir type dual relating properly efficient solutions of the primal and dual problems.

AB - A multiobjective nonlinear programming problem is considered. Sufficiency theorems are derived for efficient and properly efficient solutions under generalized (F, ρ)-convexity assumptions. Weak, strong and strict converse duality theorems are established for a general Mond-Weir type dual relating properly efficient solutions of the primal and dual problems.

KW - 90C29

KW - 90C30

KW - 90C46

UR - https://www.scopus.com/pages/publications/33745978769

U2 - 10.1515/JAA.2005.19

DO - 10.1515/JAA.2005.19

M3 - Article

AN - SCOPUS:33745978769

SN - 1425-6908

VL - 11

SP - 19

EP - 33

JO - Journal of Applied Analysis

JF - Journal of Applied Analysis

IS - 1

ER -

Sufficiency and duality in multiobjective programming with generalized (F, ρ)-convexity

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this