A class of nondifferentiable mathematical programming problems
From MaRDI portal
Publication:1393353
DOI10.1016/0022-247X(74)90289-3zbMath0276.90058MaRDI QIDQ1393353
Could not fetch data.
Publication date: 1974
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Related Items
Second order duality for nondifferentiable minimax programming problems with generalized convexity ⋮ A class of nondifferentiable control problems ⋮ Higher order duality in multiobjective fractional programming with square root term under generalized higher order \((F, \alpha, \beta, \rho, \sigma, d)\)-V-type I univex functions ⋮ On Nondifferentiable Quasiconvex Programming Problem ⋮ Second-order invex functions in nonlinear programming ⋮ Higher-order duality for a class of nondifferentiable multiobjective programming problems involving generalized type I and related functions ⋮ Optimality conditions for a class of nondifferentiable minmax programming problems ⋮ Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems ⋮ A singularly perturbed Cauchy problem ⋮ Duality with invexity for a class of nondifferentiable static and continuous programming problems ⋮ Nondifferentiable mathematical programming and convex-concave functions ⋮ More on subgradient duality ⋮ Second-order duality in nondifferentiable fractional programming ⋮ On generalized convexity and duality with a square root term ⋮ Duality for a class of nondifferentiable mathematical programming problems ⋮ A linear complementarity problem involving a subgradient ⋮ Duality for a non-differentiable programming problem ⋮ Subgradient Duality Using jFritz John Conditions ⋮ Duality for a Class of Nondifferentiable Multiple Objective Programming Problems ⋮ Constraint qualification in a general class of Lipschitzian mathematical programming problems ⋮ On duality for square root convex programs ⋮ Constraint qualification in a general class of nondifferentiable mathematical programming problems ⋮ On second-order converse duality for a nondifferentiable programming problem ⋮ A non-differentiable programming problem under strong pseudoinvexity. ⋮ Programming with a non-differentiable constraint. ⋮ A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming ⋮ On necessary conditions for a class of nondifferentiable minimax fractional programming ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ Constraint qualifications in a class of nondifferentiable mathematical programming problems ⋮ A duality theorem for a nondifferentiable nonlinear fractional programming problem ⋮ A subgradient duality theorem ⋮ Optimality criteria for a class of non differentiable non-linear programs ⋮ A system of inequalities and nondifferentiable mathematical programming ⋮ Mixed symmetric duality for nondifferentiable programming problems ⋮ Second-Order Duality for Nondifferentiable Multiobjective Programming Problems ⋮ Higher-Order Duality in Nondifferentiable Multiobjective Programming ⋮ A generalization of the Farkas lemma and applications to convex programming ⋮ A class of programming problems whose objective function contains a norm ⋮ Higher order type-I α-invexity and duality in nondifferentiable mathematical programming ⋮ Symmetric duality for nondifferentiable minimax mixed integer programming problems##The authors wish to thank a referee for his valuable suggestions which have improved the presentation of this paper. The third author is also thankful to University Grants Commission, India for providing financial support$ef: ⋮ On converse duality for a nondifferentiable program ⋮ Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions ⋮ Necessary optimality conditions for a class of nonsmooth vector optimization ⋮ Higher-order generalized invexity and duality in mathematical programming ⋮ Mond-Weir type second order symmetric duality in non-differentiable minimax mixed integer programming problems ⋮ On nonlinear programming with support functions ⋮ Symmetric dual nondifferentiable programs ⋮ Higher-order generalized invexity and duality in nondifferentiable mathematical programming ⋮ Duality and existence theory for nondifferentiable programming ⋮ Nondifferentiable fractional programming with Hanson-Mond classes of functions ⋮ Optimality conditions for fractional minmax programming ⋮ A class of nondifferentiable continuous programming problems ⋮ Generalized concavity and duality with a square root term
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear complex programming
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- An extension of the transposition theorems of Farkas and Eisenberg
- A duality theorem for non-linear programming
- Supports of a convex function
- A Gradient Inequality for a Class of Nondifferentiable Functions
- A Duality Theorem for Nonlinear Programming
- A Note on Duality Theorem for a Nonlinear Programming Problem
- Technical Note—On Converse Duality in Nonlinear Programming
- Properties of a multifacility location problem involving euclidian distances
- Technical Note—On a Duality Theorem for a Nonlinear Programming Problem
- Duality in nonlinear programming
- Dual Programs [Letter to the Editor]
- Nonlinear programming in complex space
- Nonlinear programming in complex space
This page was built for publication: A class of nondifferentiable mathematical programming problems
