본문 바로가기
  • Home

Minimum Net profit Project Deleting Algorithm for Choice of Facility Expansion Projects Problem

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2016, 21(5), pp.161-166
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

Sang-Un, Lee 1

1강릉원주대학교

Accredited

ABSTRACT

This paper suggests heuristic algorithm with   linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for  -years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

Citation status

* References for papers published after 2022 are currently being built.