{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

IE220_F08_hw3

IE220_F08_hw3 - 2 6.4-6(b 3 Consider the following problem...

This preview shows page 1. Sign up to view the full content.

IE220: Introduction to Operations Research Fall 2008 Professor P´olik Homework 3 Due Thursday, October 23 in class or online through Blackboard Important Reminders Show your work. Answers such as ( x 1 ; x 2 ) = (2; 6) are incomplete and will not be accepted. You may work on these problems with your classmates, but you must write up your assignment by yourself, and without looking at anything you wrote down when working with your group. This includes problems that you solve using a computer. Late homework will not be accepted for credit. Get started early! Your professor and TA are available to answer questions about the problems or the homework policies. Problems From the textbook. 1. 6.1-10 (every student must submit a unique problem, even if you work together)
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 2. 6.4-6 (b) 3. Consider the following problem: max x 1 + tx 2 x 2 ≤ 2 2 x 1 + 2 x 2 ≤ 7 x 1 ≤ 2 10 x 1 + x 2 ≤ 21 x 1 + 10 x 2 ≤ 21 x 1 ,x 2 ≥ , where t is a parameter. Graph the feasible set. Solve the problem for t =-1 , , . 1 , 1 , 5 , 10 , 20 and graph the optimal objective value as a function of t . How does the optimal solution change as t changes? You are encouraged to use computer tools to graph and solve the problem, but you must show some evidence of how you solved the problem (EXCEL or GAMS printout, or one of the tools that I suggested). 4. 9.3-1 (a) and (b) 5. 9.4-3...
View Full Document

{[ snackBarMessage ]}