A duality theorem for a special class of programming problems in complex space
From MaRDI portal
Publication:1844590
DOI10.1007/BF01262933zbMath0283.90041MaRDI QIDQ1844590
Publication date: 1975
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items (9)
Complex minimax programming under generalized convexity ⋮ Parametric duality on minimax programming involving generalized convexity in complex space ⋮ Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions ⋮ Duality for nondifferentiable minimax programming in complex spaces ⋮ Complex minimax fractional programming of analytic functions ⋮ Duality in finite dimensional complex space ⋮ Complex nonlinear programming: Duality with invexity and equivalent real programs ⋮ Optimality conditions for a nondifferentiable minimax programming in complex spaces ⋮ Complex minimax programming under generalized type-I functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming in complex space
- Quadratic programming in complex space
- A duality theorem for complex quadratic programming
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- An extension of the transposition theorems of Farkas and Eisenberg
- Nonlinear programming in complex space: Sufficient conditions and duality
- Duality in quadratic programming
- Symmetric dual quadratic programs
- A Duality Theorem for Nonlinear Programming
- The third cohomology group of a ring and the commutative cohomology theory
- Nonlinear programming in complex space
This page was built for publication: A duality theorem for a special class of programming problems in complex space