ملتقى طلاب وطالبات جامعة الملك فيصل,جامعة الدمام

ملتقى طلاب وطالبات جامعة الملك فيصل,جامعة الدمام (https://vb.ckfu.org/index.php)
-   منتدى كلية علوم الحاسب و تقنية المعلومات (https://vb.ckfu.org/forumdisplay.php?f=9)
-   -   السلام عليكم ورحمة الله (https://vb.ckfu.org/showthread.php?t=353067)

نور مكة 2012- 7- 29 04:38 AM

السلام عليكم ورحمة الله
 
انا عضو جديد اتمنى منكم المساعدة عندي سوال مو عارفة احلو يارت الي يعرف الحل لا يبخل عليا وشكرا



1)A company makes two products (X and Y) using two machines (A and B). Each unit of X that is produced requires 50 minutes processing time on machine A and 30 minutes processing time on machine B. Each unit of Y that is produced requires 24 minutes processing time on machine A and 33 minutes processing time on machine B.
At the start of the current week there are 30 units of X and 90 units of Y in stock. Available processing time on machine A is forecast to be 40 hours and on machine B is forecast to be 35 hours.
The demand for X in the current week is forecast to be 75 units and for Y is forecast to be 95 units. Company policy is to maximize the combined sum of the units of X and the units of Y in stock at the end of the week.
• Formulate the problem of deciding how much of each product to make in the current week as a linear program.
• Solve this linear program graphically.
2) Write the algorithm for the initial solution of the transportation problem using one method and trace it.
3) What is the relation between the dual and primal problem give an example.
:Cry111::Cry111::Cry111::Cry111::Cry111::Cry111::C ry111::Cry111::Cry111::Cry111::Cry111::Cry111::Cry 111::Cry111::Cry111::Cry111::Cry111::Cry111::Cry11 1::Cry111::Cry111:

جورجيت العرب 2012- 7- 29 08:56 PM

رد: السلام عليكم ورحمة الله
 
هههههههههههههههههههه اتمنى تحصل اللى يفيدك


All times are GMT +3. الوقت الآن حسب توقيت السعودية: 09:23 AM.

Powered by vBulletin® Version 3.8.7, Copyright ©2000 - 2024, Jelsoft Enterprises Ltd. جامعة الملك الفيصل,جامعة الدمام
المواضيع والمشاركات في الملتقى تمثل اصحابها.
يوجد في الملتقى تطوير وبرمجيات خاصة حقوقها خاصة بالملتقى
ملتزمون بحذف اي مادة فيها انتهاك للحقوق الفكرية بشرط مراسلتنا من مالك المادة او وكيل عنه