Solving cubic objective function programming problem by modification simplex method

	Solving cubic objective function programming problem by modification simplex method
International Journal of Nonlinear Analysis and Applications
مقاله 14، دوره 14، شماره 2، اردیبهشت 2023، صفحه 159-165 اصل مقاله (325.88 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22075/ijnaa.2021.25547.3050
نویسندگان
Nejmaddin A. Sulaiman^* ؛ Media A. Omer
Department of Mathematics, College of Education, Salahaddin University-Erbil, Kurdistan Region, Iraq
چکیده
In this paper, a cubic objective programming problem (COPP)is defined, which is in the form of multiplying three linear functions. The simplex method is modified to solve a cubic objective programming problem. An algorithm for its solution is suggested. The algorithm of the usual simplex method is also reported. A vital application talks about how the developed algorithm can be utilized to unravel non-linear. The proposed technique can be illustrated with the constructed numerical examples and it showed steps by tables. The results of the study indicate that the new technique, modified simplex, gets the same result which is exactly similar to other methods such us (quadratic, linear simplex method).
کلیدواژه‌ها
New Approach؛ Cubic Objective Programming Problem؛ Simplex Method
مراجع

آمار تعداد مشاهده مقاله: 17,117 تعداد دریافت فایل اصل مقاله: 10,886

پیوندهای مفید

آمار