Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

We have cash reserves in ten different currencies in the amounts given in the second column of the following table ( in millions ) .

We have cash reserves in ten different currencies in the amounts given in the second column of the
following table (in millions).
2
Initial Position Desired Position
USD 1524
EUR 7065
GBP 32
JPY 1532
CHF 23
CAD 76
AUD 86
NZD 118
HKD 3227
SGD 1822
Our objective is to convert these amounts in order to have reserves at least equal to the amounts given
in the last column of the table. The second table contains the conversion rates.
USD EUR GBP JPY CHF CAD AUD NZD HKD SGD
USD 10.76120.6016104.2630.9191.08641.07051.19247.75021.2492
EUR 1.313710.79033136.95851.207271.42711.40621.566310.18061.6409
GBP 1.662121.26531173.2971.52751.80571.77921.981912.88152.0763
JPY 0.00960.00730.005810.00880.01040.01030.01140.07430.012
CHF 1.08810.82830.6546113.44611.18211.16481.29748.4331.3592
CAD 0.92050.70070.553895.97150.84610.98541.09767.13371.1499
AUD 0.934190.71120.56297.40150.85861.014911.11397.24031.167
NZD 0.83860.63840.504687.61250.77010.91110.897716.51.0476
HKD 0.1290.09820.077613.45320.11860.14020.13810.153910.1612
SGD 0.80050.60940.481683.4650.73570.86960.85690.95466.20391
The numbers in this table should be read as follows: to buy 1 U.S. dollar for Euro requires 0.7612 e
(the element in the first row and the second column),1 U.S. dollar costs 0.6016 British pounds (GBP),
etc. If we want to buy 1 Euro for U.S. dollars we have to pay $ 1.3137(the element in the EUR row and
USD column), etc.
Design the conversion plan to meet the desired goals and to maximize the USD value of the obtained
positions.
2.2 The Linear Programming Model
Let us denote by n the number of currencies considered (n =10 in our case). Let a j , j =1,..., n
denote the initial positions and let bi , i =1,..., n, denote the desired positions. Finally, we denote by
ri j the cost of currency i in currency j (the element in row i and column j of the rates table).
We introduce the decision variables xi j representing the amounts of currency i purchased for cur-
rency j, i, j =1,..., n. For i = j the variable xii represents the amount kept in currency i.
3
The decision variables have to satisfy the following equations and inequalities, called constraints:
n
i=1
ri j xi j = a j , j =1,..., n (amount of currency j spent)
n
j=1
xi j >= bi , i =1,..., n,(amount of currency i obtained)
xi j >=0, i =1,..., n, j =1,..., n.
In the first equation we assume that only the original amounts can be converted, not the amounts obtained
from other conversions.
The set X of conversion plans x satisfying the constraints is called the feasible set.
The value of the obtained positions can be expressed as the dollar value the amounts obtained, that is
f (x)=
n
i=1
1
r1i
n
j=1
xi j .
It is called the objective function. The problem is to maximize the objective function over x in the
feasible set X , that is to find a point x in X (the optimal solution) such that
f (x)>= f (x) for all x in X

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Real Estate Investment Strategies Structures Decisions

Authors: David Hartzell, Andrew E. Baum

2nd Edition

1119526094, 978-1119526094

More Books

Students also viewed these Finance questions

Question

What are the two main characteristics of intangible assets ?

Answered: 1 week ago