Main Page
About us
About the deanship
Vision
Mision
Quality policy
Deanship booklet
Research strategic construction
Employee list
Deanship consultants
Deanship agencies
Vice deanship for research groups
Vice deanship for research
Vice deanship of scientific research female
Research groups
Internal research programs
External research programs
Research groups prorgams
About research group programs
Active research groups
Guidelines for creating a new research group
Researcher services
Scientific instrument facilitating the publication
Abhathi portal
Plagiarism detection programs
Scientific journals
Research program forms
Researchers' inquiries
Research & scientific outcome
Digital media
Instruction guidelines
Research production for institutional finance
Activities & awards
Knowledge excellence awards
Knowledge excellence awards
Knowledge excellence awards winners
Excellence reward
Scientific research week
The fourteenth scientific research week
عربي
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Deanship of Scientific Research
Document Details
Document Type
:
Project
Document Title
:
Site best unrestricted writing.
الموقع الأمثل المقيد خطياً.
Document Language
:
Arabic
Abstract
:
The aim of this research proposal to find a mathematical method (algorithm) can be used to calculate the ideal location for a point (or function or group) and subject to certain linear constraints. Will be through this research attempt to characterize the internal spaces of multiplication in terms of the relationship between the site unrestricted optimal writing (for the group under consideration). As a result of this characterization, it would be possible to adapt one of the ending algorithms currently applied (to solve the issue is not restricted) to calculate the best location subject to certain linear constraints. We have succeeded Search in proving that in the space of multiplication procedure can distinguish the best location restricted in writing in terms of the site represent unrestricted writing for the group associated with the original group, and that this always possible if the criterion was the result of striking an internal only, and has been employed this distinction to the design algorithm is limited steps to calculate the best location for the repeater group finished points. We have made clear that ensuring the convergence of this algorithm leads to the distinction of space multiplication of the Interior, have discussed the complexity of this algorithm, as we were able in one of the special cases to improve the estimated time for completion of the arithmetic of the algorithm to decrease from the account of the case of an exponential to calculate the case of many of the border.
Publishing Year
:
1420 AH
2000 AD
Sponsor Name
:
kau
Sponsorship Year
:
1420 AH
2000 AD
Added Date
:
Wednesday, April 30, 2008
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
سالم أحمد سحاب
sahab, salem ahmed
Investigator
Doctorate
Files
File Name
Type
Description
30451.docx
docx
Back To Researches Page