Search In this Thesis
   Search In this Thesis  
العنوان
The relation between the fixed point Problems and the linear Programing Problems /
المؤلف
Yasen, Mohamed Taha El-said.
هيئة الاعداد
باحث / محمود طه السيد ياسين
مشرف / أحمد فؤاد السيد دويدار
مشرف / خيري أمين سيدراك
باحث / محمود طه السيد ياسين
الموضوع
Programing Problems. Linear programming. Fixed point theory.
تاريخ النشر
1981.
عدد الصفحات
p128. ;
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
الرياضيات
تاريخ الإجازة
1/1/1981
مكان الإجازة
جامعة المنصورة - كلية العلوم - Department of Mathemtics
الفهرس
Only 14 pages are availabe for public view

from 196

from 196

Abstract

The principal aim of the disseration is to solve fixed point problems and to discuss its relation with programming problems. We discussed some known methods for compyting the approximate fixed points : One of them, for continuous functions from an n - simplex into itself f:s-s, is called Artificial start algorithm, and also two of them are for the upper - semi continuous mapping f:r-r The first is called Eaves first algorithm and the second is called ; Merrill’ restart algorithm.