شماره ركورد كنفرانس :
1339
عنوان مقاله :
An interior point algorithm for linear multiplicative programming problems
عنوان به زبان ديگر :
An interior point algorithm for linear multiplicative programming problems
پديدآورندگان :
Hosseini Alireza نويسنده , Askarizadeh Abbas نويسنده
كليدواژه :
Linear Multiplicative Programming , multiobjective programming , Method of Center , interior point method
عنوان كنفرانس :
اولين همايش ملي رياضي و آمار
چكيده فارسي :
Multiplicative programming problems (MPPs) are global optimization problems known to be NP-hard [6]. This paper proposes an interior point algorithm based on analytic center cutting-plane method to solve linear MPPs. Some primary conditions guaranty the sequence of feasible points generated by the proposed algorithm converges to optimal solution.
شماره مدرك كنفرانس :
4422467
