Duality Theorems for Convex Programming Without Constraint Qualification

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

doi 10.1017/s144678870002468x

Full Text

Abstract

Available in

Date

Authors

Publisher

Cambridge University Press (CUP)

Related search

Duality Without Constraint Qualification for Multiobjective Programming

The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
1992English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Duality Theorems for Convex and Quasiconvex Set Functions

SN Operations Research Forum
2020English

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

A Duality Theorem for Nondifferentiable Convex Programming With Operatorial Constraints

Bulletin of the Australian Mathematical Society
Mathematics
1980English

On Duality Theory of Convex Semi-Infinite Programming

Optimization
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2005English

Constraint Logic Programming for Non Convex NLP and MINLP Problems

IFAC Proceedings Volumes
2006English

New Farkas-Type Constraint Qualifications in Convex Infinite Programming

ESAIM - Control, Optimisation and Calculus of Variations
ControlComputational MathematicsOptimizationSystems Engineering
2007French

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy