topic Re: How to write un available route in sas in tranportation problem to minimize cost? in SAS Programming

How to write un available route in sas in tranportation problem to minimize cost?

rohailk — Tue, 20 Aug 2019 20:31:11 GMT

hi,

I am trying to solve a transportation problem where some routes are un available.I am able to solve the solution by hand but in SAS, can someone help me write solution for the following transportation problem.

In this problem, some routes are un available and since total capacity is not equal to total demand(i.e difference of 30), I added dummy variables to it as shown below

I have added dummy variable here. I dont know how can I write the un available route in sas. When solving by hand, I assigned infinity to these routes.

Can someone help me how to write the solution in sas?

thanks

Re: How to write un available route in sas in tranportation problem to minimize cost?

Ksharp — Wed, 21 Aug 2019 12:20:10 GMT

Ha. It is SAS/OR problem.

Post it at OR forum . @RobPratt is there .

data Products;
length Name $10.;
input Name $ Profit;
datalines;
Chocolate 0.25
Toffee 0.75
;
data Processes;
length Name $15.;
input Name $ Available_time Chocolate Toffee;
datalines;
Cooking 27000 15 40
Color/Flavor 27000 0 56.25
Condiments 27000 18.75 0
Packaging 27000 12 50
;
proc optmodel;
/ * declare sets and data indexed by sets * /
set <string> Products;
set <string> Processes;
num Profit{Products};
num AvailableTime{Processes};
num RequiredTime{Products,Processes};
/ * declare the variable * /
var Amount{Products};
/ * maximize objective function (profit) * /
maximize TotalProfit = sum{p in Products} Profit[p] * Amount[p];
/ * subject to constraints * /
con Availability{r in Processes}:
sum{p in Products} RequiredTime[p,r] * Amount[p] <= AvailableTime[r];
/ * abstract algebraic model that captures the structure of the * /
/ * optimization problem has been defined without referring * /
/ * to a single data constant * /
/ * populate model by reading in the specific data instance * /
read data Products into Products=[name] Profit;
read data Processes into Processes=[name] AvailableTime=Available_time
{p in Products} <RequiredTime[p,name]= col(p)>;
/ * solve LP using primal simplex solver * /
solve with lp / solver = primal_spx;
/ * display solution * /
print Amount;
quit;

Re: How to write un available route in sas in tranportation problem to minimize cost?

rohailk — Fri, 23 Aug 2019 09:54:43 GMT

thank you so much...where is OR forum...i tried to search but couldnt find it..can you help how to find OR forum..thanks

Re: How to write un available route in sas in tranportation problem to minimize cost?

Ksharp — Fri, 23 Aug 2019 11:40:18 GMT

Here is : https://communities.sas.com/t5/Mathematical-Optimization/bd-p/operations_research

Re: How to write un available route in sas in tranportation problem to minimize cost?

rohailk — Sat, 24 Aug 2019 21:10:22 GMT

Thank you so much.

I posted my question there but no one is answering 😞

Please can you answer my question. This is the link

https://communities.sas.com/t5/Mathematical-Optimization/using-proc-optmodel-first-time/m-p/583422#M2848

sorry I deleted the above post. Now I posted it here

https://communities.sas.com/t5/Mathematical-Optimization/Using-PROC-OPTMODEL-to-calculate-profit-and-shadow-price/m-p/583708#M2849

I will greatly appreciate your kind help

thanks

Re: How to write un available route in sas in tranportation problem to minimize cost?

Ksharp — Sun, 25 Aug 2019 11:52:39 GMT

Sorry. I am a rookie of SAS/OR . But you can refer to the example above I posted.

Maybe @RobPratt is too busy to answer your question, tomorrow might he will present at this forum .