

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
The instructions and three problems for an operations research assignment in the mth601 course (spring-2012). Students are required to have a good understanding of lecture # 24 to lecture # 30 and are encouraged to use recommended books for clarification. The assignment is worth 30 marks and must be submitted in word format by the due date. Problems involving maximization and minimization using linear programming and the two-phase method.
Typology: Exercises
1 / 2
This page cannot be seen from the preview
Don't miss anything!
Assignment: # 04 (Spring-2012) Mth601 (Operations Research) Lecture: 24– 30 Total Marks = 30
th
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 # 24 to Lecture # 30 2. Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in Lecture # 24 to Lecture # 30 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. Assignments through e-mail will be acceptable after (before uploading the solution file) due date but with deduction of 30% of obtained marks.
Max: z =2 x 1 – x 2 + x 3 by using TWO phase method, Subject to: x 1 + x 2 –3 x 3 ≤ 8 4 x 1 – x 2 + x 3 ≥ 2 2 x 1 +3 x 2 – x 3 ≥ 4 x 1 , x 2 , x 3 ≥ 0
Give the dual of the following LP problem and hence solve it. Max: z = 3 x 1 – 2 x 2 Subject to: x 1 ≤ 4 x 2 ≤ 6 x 1 + x 2 ≤ 5
Minimize z = x 1 + x 2 + x 3 Subject to x 1 – 3 x 2 +4 x 3 = 5 x 1 –2 x 2 ≤ 3 2 x 2 – x 3 ≥4, x 1 , x 2 ≥0 and x 3 is unrestricted.