Assignment: # 03 (Spring-2012)

Mth601 (Operations Research)

Lecture: 17– 23

Total Marks = 30

Due date: 30th 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

  1. Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in Lecture # 17 to Lecture # 23
  2. You should concern recommended books for clarify your concepts as handouts are not sufficient.
  3. 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.
  4. 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.
  5. 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.
  6. Assignments through e-mail will be acceptable after (before uploading the solution file) due date but with deduction of 30% of obtained marks.

1)

Given that there are n different foods say F1,F2,…..,Fn and m different nutrients such that:

Cost of one unit of food stuff j = cj, j=1,2,…,n

No. of nutrient I in one unit of food stuff j = aij , i =1,2,…,,m

Minimum daily nutrient of the nutrient i = Vi .

Then determine the daily diet satisfying the minimum daily requirements of nutrients at minimum cost.(Just model as an LP problem)

2)

Solve the following Linear Programming problem by graphical method,

Min z =x1+x2

Subject to

5x1+10x2≤50

x1+x2≥1

x2≤4,

x1,x2≥0

3)

Solve the following Linear Programming problem by Simplex Method

Max z =4x1+3x2

Subject to

x1+x2≤50

x1+2x2≥80

3x1+2x2≥140

x1,x2≥0