On interval-valued optimization problems with generalized invex functions
DOI10.1186/1029-242X-2013-313zbMATH Open1292.90312OpenAlexW2130755446WikidataQ59299938 ScholiaQ59299938MaRDI QIDQ2437706FDOQ2437706
Authors: I. 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
Recommendations
- On interval-valued programming problem with invex functions
- Wolfe duality theory for interval-valued programming
- Sufficient optimality conditions and duality for nonsmooth interval-valued optimization problems via \(L\)-invex-infine functions
- On interval-valued invex mappings and optimality conditions for interval-valued optimization problems
- Optimality condition and Wolfe duality for invex interval-valued nonlinear programming problems
nonlinear programmingsufficiencydualityinterval-valued functionsLU-optimal\({(p,r)-\rho-(\eta, \theta)}\)-invexity
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- 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
- \((p,r)\)-invex sets and functions
- Duality theory for optimization problems with interval-valued objective functions
- On sufficiency and duality for a class of interval-valued programming problems
- Algorithms for Linear Programming Problems with Interval Objective Function Coefficients
- An Algorithm for Solving Interval Linear Programming Problems
- Symmetric duality with \((p,r)-\rho -(\eta,\theta)\)-invexity
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
Cited In (23)
- Applications of generalized inverses to interval linear programs in hilbert spaces
- Optimality conditions and duality for interval-valued optimization problems using convexifactors
- Sufficiency and duality in non-smooth interval valued programming problems
- On optimal control problems with generalized invariant convex interval-valued functionals
- Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function
- Continuous-time optimization problems involving invex functions
- On first and second order multiobjective programming with interval-valued objective functions
- Necessary and Sufficient Optimality Conditions for Fractional Interval-Valued Optimization Problems
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Using \(\rho \)-cone arcwise connectedness on parametric set-valued optimization problems
- On a class of interval-valued optimization problems
- Interval-valued programming problem with infinite constraints
- Optimality conditions for interval-valued univex programming
- Convex optimization of interval valued functions on mixed domains
- Title not available (Why is that?)
- Sufficiency and duality for nonsmooth interval-valued optimization problems via generalized invex-infine functions
- Wolfe duality theory for interval-valued programming
- Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems
- Newton method to obtain efficient solutions of the optimization problems with interval-valued objective functions
- On nondifferentiable semi-infinite multiobjective programming with interval-valued functions
- ON OPTIMALITY OF GENERALIZED OPTIMIZATION PROBLEMS ASSOCIATED WITH OPERATOR AND EXISTENCE OF (Tη; ξθ)-INVEX FUNCTIONS
- An exact \(l_1\) penalty approach for interval-valued programming problem
- A Newton method for capturing efficient solutions of interval optimization problems
This page was built for publication: On interval-valued optimization problems with generalized invex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437706)
