شماره ركورد كنفرانس :
3502
عنوان مقاله :
Removing big M Problem in Linear Programming
Author/Authors :
Saeed Nabavi Semnan University , Mohammad Javad Latifi Iran University of Science and Technology
كليدواژه :
Linear Programming , Big M Method , Linear Fractional Programming , Feasible Base , Absolute value Problem
سال انتشار :
شهريور 1393
عنوان كنفرانس :
چهل و پنجمين كنفرانس رياضي ايران
زبان مدرك :
انگليسي
چكيده لاتين :
In big M methods we use a big number instead of M. This is a big problem in computer computation. In this paper we have proposed a method for computer computation. We use a pair number instead of a big number and explain how to use this in own computation. This method could be used in every big M method, not necessary for finding feasible basis in linear programming such that linear fractional programming and problem with absolute value condition and etc.. It should be noted The proposed method does not increase number of computation.
كشور :
ايران
تعداد صفحه 2 :
3
از صفحه :
1
تا صفحه :
3
لينک به اين مدرک :
بازگشت