Show simple item record

On recent existence theorems in the theory of optimization

dc.contributor.authorSuryanarayana, Manda Butchien_US
dc.contributor.authorCesari, Lambertoen_US
dc.date.accessioned2006-09-11T15:48:35Z
dc.date.available2006-09-11T15:48:35Z
dc.date.issued1980-07en_US
dc.identifier.citationCesari, L.; Suryanarayana, M. B.; (1980). "On recent existence theorems in the theory of optimization." Journal of Optimization Theory and Applications 31(3): 397-415. <http://hdl.handle.net/2027.42/45217>en_US
dc.identifier.issn0022-3239en_US
dc.identifier.issn1573-2878en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/45217
dc.description.abstractA condition recently proposed is shown to imply the weak compactness in H 1,1 and actually is equivalent to another condition previously proposed by the authors. Once compactness is proved, then existence theorems follow from lower closure theorems also previously proved by the authors, and extended to Pareto problems. The present analysis adds to the recent work of Goodman concerning the equivalence of seminormality conditions with concepts of convex analysis and lattice theory.en_US
dc.format.extent1126903 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherKluwer Academic Publishers-Plenum Publishers; Plenum Publishing Corporation ; Springer Science+Business Mediaen_US
dc.subject.otherMathematicsen_US
dc.subject.otherTheory of Computationen_US
dc.subject.otherApplications of Mathematicsen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherEngineering, Generalen_US
dc.subject.otherLower Closureen_US
dc.subject.otherWeak Compactnessen_US
dc.subject.otherExistence Theoremsen_US
dc.subject.otherProperty ( Q )en_US
dc.subject.otherOperation Research/Decision Theoryen_US
dc.subject.otherLipschitz Type Conditionsen_US
dc.subject.otherConvex Dualityen_US
dc.subject.otherOptimizationen_US
dc.subject.otherOptimizationen_US
dc.titleOn recent existence theorems in the theory of optimizationen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michiganen_US
dc.contributor.affiliationotherDepartment of Mathematics, Eastern Michigan University, Ypsilanti, Michiganen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/45217/1/10957_2004_Article_BF01262981.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/BF01262981en_US
dc.identifier.sourceJournal of Optimization Theory and Applicationsen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.