A Duality Theorem for Nondifferentiable Convex Programming With Operatorial Constraints

Bulletin of the Australian Mathematical Society - United Kingdom
doi 10.1017/s0004972700006419
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Optimality Conditions and Duality for Nondifferentiable Multiobjective Programming

Review of Computer Engineering Studies
2018English

Efficiency and Generalized Convex Duality for Nondifferentiable Multiobjective Programs

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2010English

Technical Note—On Converse Duality for a Nondifferentiable Programming Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1977English

Symmetric Duality Results for Second -Order Nondifferentiable Multiobjective Programming Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
2019English

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

On Duality Theory for Non-Convex Semidefinite Programming

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

Duality Theorems for Convex Programming Without Constraint Qualification

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1984English

Generalized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming

Abstract and Applied Analysis
Applied MathematicsAnalysis
2011English

Efficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative

Applied Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy