On interval-valued optimization problems with generalized invex functions

DOI10.1186/1029-242X-2013-313zbMath1292.90312OpenAlexW2130755446WikidataQ59299938 ScholiaQ59299938MaRDI QIDQ2437706

Izhar Ahmad, Anurag Jayswal, Jonaki Banerjee

Publication date: 13 March 2014

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2013-313

zbMATH Keywords

dualitynonlinear programmingsufficiencyinterval-valued functionsLU-optimal\({(p,r)-\rho-(\eta, \theta)}\)-invexity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (15)

An exact \(l_1\) penalty approach for interval-valued programming problem ⋮ Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions ⋮ Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems ⋮ Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions ⋮ Interval-valued programming problem with infinite constraints ⋮ On nondifferentiable semi-infinite multiobjective programming with interval-valued functions ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems ⋮ Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function ⋮ Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions ⋮ Unnamed Item ⋮ A Newton method for capturing efficient solutions of interval optimization problems ⋮ Sufficiency and duality in non-smooth interval valued programming problems ⋮ Optimality conditions for interval-valued univex programming

Cites Work

• On sufficiency and duality for a class of interval-valued programming problems
• Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity
• Duality theory for optimization problems with interval-valued objective functions
• Wolfe duality for interval-valued optimization
• On sufficiency of the Kuhn-Tucker conditions
• Multiobjective programming in optimization of interval objective functions -- a generalized approach
• Efficient solution of interval optimization problem
• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
• On interval-valued nonlinear programming problems
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
• An Algorithm for Solving Interval Linear Programming Problems
• \((p,r)\)-invex sets and functions

This page was built for publication: On interval-valued optimization problems with generalized invex functions