On sufficiency and duality for a class of interval-valued programming problems

Anurag Jayswal; Ioan Stancu-Minasian; I. Ahmad

doi:10.1016/j.amc.2011.09.041

On sufficiency and duality for a class of interval-valued programming problems

Anurag Jayswal^*
, Ioan Stancu-Minasian
, I. Ahmad

^*Corresponding author for this work

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

87 Scopus citations

Abstract

In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.

Original language	English
Pages (from-to)	4119-4127
Number of pages	9
Journal	Applied Mathematics and Computation
Volume	218
Issue number	8
DOIs	https://doi.org/10.1016/j.amc.2011.09.041
State	Published - 15 Dec 2011

Keywords

Duality
Efficiency
Generalized convexity
Interval-valued programming problems
Sufficient optimality conditions

ASJC Scopus subject areas

General Computer Science
Computational Mathematics
Applied Mathematics

Access to Document

10.1016/j.amc.2011.09.041

Cite this

@article{d95ce2ace5a9408283b642df23d675c5,

title = "On sufficiency and duality for a class of interval-valued programming problems",

abstract = "In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.",

keywords = "Duality, Efficiency, Generalized convexity, Interval-valued programming problems, Sufficient optimality conditions",

author = "Anurag Jayswal and Ioan Stancu-Minasian and I. Ahmad",

year = "2011",

month = dec,

day = "15",

doi = "10.1016/j.amc.2011.09.041",

language = "English",

volume = "218",

pages = "4119--4127",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

number = "8",

}

TY - JOUR

T1 - On sufficiency and duality for a class of interval-valued programming problems

AU - Jayswal, Anurag

AU - Stancu-Minasian, Ioan

AU - Ahmad, I.

PY - 2011/12/15

Y1 - 2011/12/15

N2 - In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.

AB - In this paper, we are concerned with an interval-valued programming problem. Sufficient optimality conditions are established under generalized convex functions for a feasible solution to be an efficient solution. Appropriate duality theorems for Mond-Weir and Wolfe type duals are discussed in order to relate the efficient solutions of primal and dual programs.

KW - Duality

KW - Efficiency

KW - Generalized convexity

KW - Interval-valued programming problems

KW - Sufficient optimality conditions

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

U2 - 10.1016/j.amc.2011.09.041

DO - 10.1016/j.amc.2011.09.041

M3 - Article

AN - SCOPUS:81855194006

SN - 0096-3003

VL - 218

SP - 4119

EP - 4127

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

IS - 8

ER -

On sufficiency and duality for a class of interval-valued programming problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this