Open AccessMinimum Net profit Project Deleting Algorithm for Choice of Facility Expansion Projects Problem
Author(s) -
Sang-Un Lee
Publication year - 2016
Publication title -
han-guk keompyuteo jeongbo hakoe nonmunji/han'gug keompyuteo jeongbo haghoe nonmunji
Language(s) - English
Resource type - Journals
eISSN - 2383-9945
pISSN - 1598-849X
DOI - 10.9708/jksci.2016.21.5.161
Subject(s) - linear programming , mathematical optimization , sort , profit (economics) , time complexity , mathematics , net (polyhedron) , dynamic programming , heuristic , criss cross algorithm , simple (philosophy) , algorithm , net present value , net profit , computer science , linear fractional programming , economics , arithmetic , philosophy , geometry , epistemology , production (economics) , macroeconomics , microeconomics