Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/12294
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Ashok Kumar-
dc.date.accessioned2014-11-30T09:58:35Z-
dc.date.available2014-11-30T09:58:35Z-
dc.date.issued1973-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/12294-
dc.guideChandra, Ravish-
dc.description.abstractIn many optimization problems, practical consider- ations place constraints or limitations on the range of permissible values. There are a number of reformulations that take into account the constraints and convert a constrained problem into a free-optimization. In this dissertation a number of methods for optimization of unconstrained static problems are discussed. Necessary modification for application of these methods to constrained optimization problems are also discussed.en_US
dc.language.isoenen_US
dc.subjectELECTRICAL ENGINEERINGen_US
dc.subjectCOMPUTATIONAL METHODSen_US
dc.subjectOPTIMIZATIONen_US
dc.subjectPERMISSIBLE VALUESen_US
dc.titleCOMPUTATIONAL METHODS IN OPTIMIZATIONen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number107799en_US
Appears in Collections:MASTERS' THESES (Electrical Engg)

Files in This Item:
File Description SizeFormat 
EED107799.pdf1.67 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.