Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

(Write the Lingo Algorithm that will solve this model) OilCo produces oil at two

ID: 3771224 • Letter: #

Question

(Write the Lingo Algorithm that will solve this model)

OilCo produces oil at two wells. Well 1 can produce
as many as 150,000 barrels per day, and well 2 can produce
as many as 200,000 barrels per day. It is possible to ship oil
directly from the wells to Oilco’s customers in Lagos and
Accra. Alternatively, Oilco could transport oil to
the ports of Bonny and Forcados and then ship it by tanker
to Accra or Lagos. Lagos requires 160,000
barrels per day, and Accra requires 140,000 barrels per
day. The costs of shipping 1,000 barrels between two points
are shown in the Table below. Formulate a transshipment model
(and equivalent transportation model) that could be used to
minimize the transport costs in meeting the oil demands of
Lagos and Accra.

N:B Dashes indicate shipments that are not allowed.

To ($) From Well 1 Well 2 Bonny Forcados Accra Lagos Well 1 0 - 10 13 25 28 Well 2 - 0 15 12 26 25 Bonny - - 0 6 16 17 Forcados - - 6 0 14 16 Accra - - - - 0 15 Lagos - - - - 15 0

Explanation / Answer

As we seein in above problem, Some of the items are depends on some items and they can send data to more than one items at a same time. So this approach is cluster type approach.

So algorithm for this approach is:

A term-document matrix of terms not marked as stop-words and with frequency higher than the Term Frequency Threshold;
, U, V SVD(A); {Product of SVD decomposition of A}
k 0; {Start with zero clusters}
n rank(A);
repeat
k k + 1;
q (
Pk
i=1 ii)/(
Pn
i=1 ii);
until q < Candidate Label Threshold;
P phrase matrix for Pf ; {See section 3.3}
for all columns of U
T
k P do
find the largest component mi in the column;
add the corresponding phrase to the Cluster Label Candidates set;
labelScore mi;
end for