期刊名称：International Journal of Computer Science and Network
印刷版ISSN：2277-5420
出版年度：2013
卷号：2
期号：4
页码：32-42
出版社：IJCSN publisher
摘要：Many applications in business and economics involve a processcalled optimization, in which we will be required to find theminimum cost, the maximum profit, or the minimum use ofresources, where a decision maker may want to utilize limitedavailable resources in the best possible manner. The limitedresources may include material, money, manpower, space andtime. Linear Programming provides various methods of solvingsuch problems. The formulation of linear programming problemas a mathematical model is one type of optimization problemcalled linear programming. There are various methods forsolving the linear programming problems. Some of them areapproximation algorithm , branch and bound methods, cuttingplane method etc. Other than Gomory’s cutting plane method,Branch and bound method LPP along with the DHALP (Directheuristic algorithm for linear programming) algorithm which ismore efficient than these existing methods will be used forsolving linear programming problems. An optimality test willalso be included in this. Numerical experiments will depict theutility/scope of such a procedure
关键词：Linear programming; maximization; minimization;direct heuristic algorithm; interval valued linear fractional;programming problem (IVLFP); Index array; least square;inverse; norm; optimal solution; linear programming problem
