Duality for nondifferentiable nonlinear programming problems: A feasible direction approach

MaRDI QIDQ1184766zbMATH OpenFDO

Authors Shashi Aggarwal, Davinder Bhatia

Publication date 28 June 1992

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

Dini derivativesdualityfeasible directionnondifferentiable nonlinear programmingpseudoconcavity

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Nonlinear programming (90C30) Fractional programming (90C32)

Review text

The authors consider the optimization problem (P): max \(g(x)\) over the set \(X=\{x\in\mathbb{R}^ n\mid f_ j(x)\) \(\geq 0\), \(j=1,\dots,m\}\), where the functions \(g\), \(f_ 1,\dots,f_ m\) are proper real functions on \(\mathbb{R}^ n\) but not necessarily differentiable. It is shown that a generalized dual of (P) defined in terms of Dini derivatives can be a useful tool of solving (P) specially in the case when \(g\) is pseudoconcave.

Recommendations

• Non-differentiable pseudo-convex functions and duality for minimax programming problems
• Duality in nondifferentiable minimax fractional programming with generalized convexity
• scientific article; zbMATH DE number 125600
• Duality for a non-differentiable programming problem
• Duality and existence theory for nondifferentiable programming

Cited in

(2)

• scientific article; zbMATH DE number 883252 (Why is no real title available?)
• Dini derivatives in optimization — Part II

This page was built for publication: Duality for nondifferentiable nonlinear programming problems: A feasible direction approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184766)