Checking strong optimality of interval linear programming with inequality constraints and nonnegative constraints

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS

卷:260

Article

Luo, Jiajia¹  Li, Wei¹  Wang, Qin² 

[1] Hangzhou Dianzi Univ, Sch Sci, Hangzhou 310018, Zhejiang, Peoples R China

[2] China Jiliang Univ, Coll Sci, Hangzhou 310018, Zhejiang, Peoples R China

关键词: Interval linear programming;    Strong feasible solutions;    Strong optimal solutions;    Tangent cone;   

DOI  :  10.1016/j.cam.2013.09.075

来源: Elsevier

【 摘 要 】

This paper considers optimal solutions of interval linear programming problems, in a unified framework. Necessary and sufficient conditions for checking (A, b)-strong optimality and (A, b, c)-strong optimality of interval linear programming with inequality constraints are developed. The features of the proposed methods are illustrated by some examples. (C) 2013 Elsevier B.V. All rights reserved.

【 授权许可】

Free