Full metadata record
DC FieldValueLanguage
dc.contributor.authorLI, HLen_US
dc.date.accessioned2014-12-08T15:04:51Z-
dc.date.available2014-12-08T15:04:51Z-
dc.date.issued1992-07-01en_US
dc.identifier.issn0305-0548en_US
dc.identifier.urihttp://hdl.handle.net/11536/3369-
dc.description.abstractFor a nonlinear 0-1 integer programming problem with constraint set X = (x1,...,x(n)), we first add new constraints [GRAPHICS] to the constraint set, thus to convert the integer problem into a nonlinear programming problem. Then we utilize a modified penalty function method to solve this nonlinear program to obtain a local optima Running the proposed method by a widely commercialized nonlinear program software shows that this method is more convenient than current approaches as branch-and-bound method and implicit enumeration method. One issue remained for studies is to expand this method into a global method by systematically generating suitable starting points then to perform optimization processes from each of these points.en_US
dc.language.isoen_USen_US
dc.titleAN APPROXIMATE METHOD FOR LOCAL OPTIMA FOR NONLINEAR MIXED INTEGER PROGRAMMING-PROBLEMSen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTERS & OPERATIONS RESEARCHen_US
dc.citation.volume19en_US
dc.citation.issue5en_US
dc.citation.spage435en_US
dc.citation.epage444en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊管理與財務金融系 註:原資管所+財金所zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Information Management and Financeen_US
dc.identifier.wosnumberWOS:A1992HV15900010-
dc.citation.woscount19-
Appears in Collections:Articles