<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

NONLINEAR INTEGER BILEVEL PROGRAMMING

dc.citation.epage587en_US
dc.citation.issue3en_US
dc.citation.spage574en_US
dc.citation.volume72en_US
dc.citation.woscount7
dc.contributor.authorJAN, RHen_US
dc.contributor.authorCHERN, MSen_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.date.accessioned2014-12-08T15:20:06Z
dc.date.available2014-12-08T15:20:06Z
dc.date.issued1994-02-10en_US
dc.description.abstractIn many decentralized organizations, resource planning with sequential decision making can be formulated as a multi-level programming problem. In such cases, the decision variables are partitioned among the decision makers. Each of the decision makers optimizes his/her own objective function. This paper presents an algorithm using parametric analysis to solve a typical kind of nonlinear integer multilevel programming problems, called separable integer monotone bilevel programming (SIMBP), and then extends the algorithm for solving a parametric SIMBP problem. A numerical example with application of reliability optimization is given to illustrate the solution method.en_US
dc.identifier.issn0377-2217en_US
dc.identifier.journalEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/14258
dc.identifier.wosnumberWOS:A1994NH58700010
dc.language.isoen_USen_US
dc.subjectMULTILEVEL PROGRAMMINGen_US
dc.subjectNONLINEAR INTEGER PROGRAMMINGen_US
dc.subjectPARAMETRIC PROGRAMMINGen_US
dc.titleNONLINEAR INTEGER BILEVEL PROGRAMMINGen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: