Return to search

Convex programming without constraint qualification : a study of Pareto optimality

No description available.
Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.45990
Date January 1975
CreatorsFraklin, Martin Gordon.
PublisherMcGill University
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Formatapplication/pdf
CoverageMaster of Science (Department of Mathematics)
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
Relationalephsysno: 000274496, proquestno: AAIMK27131, Theses scanned by UMI/ProQuest.

Page generated in 0.0105 seconds