

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Prof. Karunashankar Sidhu gave this assignment at Institute of Mathematical Sciences for Basic Mathematics course. It includes: Linear, Programming, Variance, Graphical, Simplex, Concept, Format, Assignment
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!
Assignment: # 03 (Spring-2012) Mth601 (Operations Research) Lecture: 17– 23 Total Marks = 30 Due date: 30 th^ May, 2012 INSTRUCTIONS
Please read the following instructions before attempting to solve this assignment
1. In order to attempt this assignment you should have full command on Lecture # 17 to Lecture # 23 2. Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in Lecture # 17 to Lecture # 23 3. You should concern recommended books for clarify your concepts as handouts are not sufficient. 4. Try to make solution by yourself and protect your work from other students. If we found the solution files of some students are same then we will reward zero marks to all those students. 5. You are supposed to submit your assignment in Word format any other formats like scan images, PDF format etc will not be accepted and we will give zero marks to these assignments. 6. If there is any problem in submitting your assignment through LMS, you can send your solution file through email with in due date. You are advised to upload your assignment at least two days before Due date. 7. Assignments through e-mail will be acceptable after (before uploading the solution file) due date but with deduction of 30% of obtained marks.
Given that there are n different foods say F 1 , F 2 ,….., F n and m different nutrients such that: Cost of one unit of food stuff j = c j , j =1,2,…, n No. of nutrient I in one unit of food stuff j = a ij , i =1,2,…,, m Minimum daily nutrient of the nutrient i = V i. Then determine the daily diet satisfying the minimum daily requirements of nutrients at minimum cost.(Just model as an LP problem)
Solve the following Linear Programming problem by graphical method, Min z = x 1 + x 2 Subject to 5 x 1 +10 x 2 ≤ 50 x 1 + x 2 ≥ 1 x 2 ≤4, x 1 , x 2 ≥ 0
Solve the following Linear Programming problem by Simplex Method Max z =4 x 1 +3 x 2 Subject to x 1 + x 2 ≤ 50 x 1 +2 x 2 ≥ 80 3 x 1 +2 x 2 ≥ 140 x 1 , x 2 ≥ 0