Return to search

Convex programming without constraint qualification : a study of Pareto optimality

No description available.
Identiferoai:union.ndltd.org:mcgill.ca/oai:escholarship.mcgill.ca:m326m3288
Date January 1975
CreatorsFraklin, Martin Gordon.
PublisherMcGill University
Source SetsMcGill University
Languagehttp://id.loc.gov/vocabulary/iso639-2/eng
Detected LanguageEnglish
TypeThesis
RightsAll items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated.
RelationPid: 45990, Proquest: AAIMK27131

Page generated in 0.0159 seconds