Ajou University repository

카디널리티 제약 선형 계획법에 대한 유한 수렴 절단 알고리즘
Citations

SCOPUS

0

Citation Export

Publication Year
2024-05
Journal
한국경영과학회지
Publisher
한국경영과학회
Citation
한국경영과학회지, Vol.49 No.2, pp.1-9
Keyword
Cardinality Constrained Optimization ProblemsFacial Disjunctive ProgrammingCutting Plane AlgorithmConvexification
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.
ISSN
1225-1119
Language
Kor
URI
https://aurora.ajou.ac.kr/handle/2018.oak/36008
DOI
https://doi.org/10.7737/JKORMS.2024.49.2.001
Type
Article
Show full item record

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

Related Researcher

Kim, Jinhak  Image
Kim, Jinhak 김진학
Department of Business Administration
Read More

Total Views & Downloads

File Download

  • There are no files associated with this item.