This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: IEOR E4007 G. Iyengar Homework #2 1. Simple problems on simplex Consider a linear program with n = 4 variables and m = 2 constraints. Suppose the current basis B = { 1 , 2 } and the constraints are given by x 1 3 x 3 +3 x 4 = 6 x 2 8 x 3 +4 x 4 = 4 For each of the following set of objective vectors decide whether the current basis is optimal, if not then move to a better basis or declare the problem is unbounded. (a) max c = 1 1 3 1 (b) max c = 0 0 3 1 (c) min c = 1 1 3 8 2. Tinyco Cash Flow Management The cash position of the company is described as follows. Initial holding $200,000 in shortterm bonds Demand for cash in months i = 1 , 2 ,..., 5: 100, 300, 500, 10, 30 (in thou sands) Cash earns 0.5% per month and shortterm bond earns 0.9% per month Tinyco can borrow up to $100,000 at 1% interest per month Transaction cost of 0.2% is charged for cash bonds. The bond coupon (interest) is paid in cash (no transaction costs) The goal of the company is to maximize cash position at the end of five months while meeting its liabilities. Formulate and solve the LP that solves this problem. 3. Exercise 3.12 & 3.18 from Optimization Methods in Finance You might want to read Section 3.2 and 3.3.2 before attempting to do this problem. (a) Exercise 3.12 (b) Exercise 3.18 1 4. Formulating dual problems Formulate the duals of the following linear programs and also formulate the corre sponding complementary slackness conditions....
View
Full
Document
This note was uploaded on 06/02/2010 for the course IEOR IEOR E4007 taught by Professor Optimizationmodelsandmethods during the Summer '09 term at Columbia.
 Summer '09
 OptimizationModelsandMethods

Click to edit the document details