On Duality Theory of Convex Semi-Infinite Programming

Optimization - United Kingdom
doi 10.1080/02331930500342823
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Informa UK Limited

Related search

On Duality Theory for Non-Convex Semidefinite Programming

Annals of Operations Research
Management ScienceDecision SciencesOperations Research
2011English

Semi-Infinite Programming

Lecture Notes in Control and Information Sciences
LibraryInformation Sciences
1979English

Multiobjective Duality for Convex Semidefinite Programming Problems

Zeitschrift fur Analysis und ihre Anwendung
Applied MathematicsAnalysis
2003English

Generalized Semi-Infinite Programming: A Tutorial

Journal of Computational and Applied Mathematics
Computational MathematicsApplied Mathematics
2008English

Duality Theorems for Convex Programming Without Constraint Qualification

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

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

New Farkas-Type Constraint Qualifications in Convex Infinite Programming

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

A Duality Theorem for Nondifferentiable Convex Programming With Operatorial Constraints

Bulletin of the Australian Mathematical Society
Mathematics
1980English

A Solution Method for Combined Semi-Infinite and Semi-Definite Programming

ANZIAM Journal
Mathematics
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy