Optimality Condition and Wolfe Duality for Invex Interval-Valued Nonlinear Programming Problems | Zendy

Jianke Zhang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimality Condition and Wolfe Duality for Invex Interval-Valued Nonlinear Programming Problems

Author(s) -

Jianke Zhang

Publication year - 2013

Publication title -

journal of applied mathematics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.307

H-Index - 43

eISSN - 1687-0042

pISSN - 1110-757X

DOI - 10.1155/2013/641345

Subject(s) - mathematics , duality (order theory) , interval (graph theory) , nonlinear programming , nonlinear system , duality gap , strong duality , mathematical optimization , pure mathematics , optimization problem , combinatorics , physics , quantum mechanics

The concepts of preinvex and invex are extended to the interval-valued functions. Under the assumption of invexity, the Karush-Kuhn-Tucker optimality sufficient and necessary conditions for interval-valued nonlinear programming problems are derived. Based on the concepts of having no duality gap in weak and strong sense, the Wolfe duality theorems for the invex interval-valued nonlinear programming problems are proposed in this paper

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research