Back to search

University of British Columbia

Duality in convex programming

Abstract

dc:description

Problems of minimizing a convex function or maximizing a concave function over a convex set are called convex programming problems. Duality principles relate two problems, one a minimization problem, the other a maximization problem, in such a way that a solution to one implies a solution to the other and that the minimum value of one is equal to the maximum value of the other. When the functions are linear and the constraint sets are polyhedral, the problems are called linear programming problems. Their duality is well-known. Certain duality results of linear programming can be extended to convex programming by means of the theory of conjugate convex functions introduced by Fenchel ([1], [2]). In this thesis the theory of conjugate functions is generalized and applied to convex programming problems. In particular a duality theorem is given for a class of convex programming problems. This theorem is compared with a duality theorem for convex programming problems given by Dorn [3].

Degree

thesis:*
Name thesis:degree_name
Master of Arts - MA
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
1966

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Muir, David Charles William

Rights

dc:rights
Statement dc:rights
  • For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/37031

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Muir, David Charles William. Duality in convex programming. master's thesis, University of British Columbia, 1966. http://hdl.handle.net/2429/37031