Citation Export
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김진학 | - |
dc.date.issued | 2024-05 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | https://aurora.ajou.ac.kr/handle/2018.oak/36008 | - |
dc.description.abstract | The current studies finitely convergent cutting plane algorithm for a cardinality constrained linear program (CCLP), which is a linear program defined over the hypercube with an additional constraint that the number of non-zero components in the decision variable does not exceed a specified positive integer . The construction of the cutting planes is based on the fact that a solution to the linear relaxation that violates the cardinality constraint must have nonzero components. Based on this observation, the cardinality constraint can be written as a conjunctive normal form, thereby providing a facial disjunctive formulation for the feasible set of the CCLP. Leveraging this facial structure of the CCLP, we develop a specialized cutting plane algorithm that terminates within a finite number of iterations. | - |
dc.language.iso | Kor | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 카디널리티 제약 선형 계획법에 대한 유한 수렴 절단 알고리즘 | - |
dc.title.alternative | A Finitely Convergent Cutting Plane Algorithm for Cardinality Constrained Linear Programs | - |
dc.type | Article | - |
dc.citation.endPage | 9 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 1 | - |
dc.citation.title | 한국경영과학회지 | - |
dc.citation.volume | 49 | - |
dc.identifier.bibliographicCitation | 한국경영과학회지, Vol.49 No.2, pp.1-9 | - |
dc.identifier.doi | 10.7737/JKORMS.2024.49.2.001 | - |
dc.subject.keyword | Cardinality Constrained Optimization Problems | - |
dc.subject.keyword | Facial Disjunctive Programming | - |
dc.subject.keyword | Cutting Plane Algorithm | - |
dc.subject.keyword | Convexification | - |
dc.type.other | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.