BookmarkSubscribeRSS Feed
🔒 This topic is solved and locked. Need further help from the community? Please sign in and ask a new question.
nep0827
Calcite | Level 5

Find all optimal solutions to the following LP in SAS.

 

Max Z  = 3X[1] + 3X[2]

s.t.    X[1] + X[2] <= 1

        All X[i] => 0

 

Please help me with just the codes. I can interpret once I see them. Appreciate the help, in advance!

1 ACCEPTED SOLUTION

Accepted Solutions
PeterClemmensen
Tourmaline | Level 20

@nep0827, does this represent your actual problem? Any two positive number numbers that sum to 1 will optimize this problem. However, as answered in your previous thread, you can find one of those solutions like this

 

proc optmodel;
var x{i in 1..2} >= 0;
max z = 3*x[1] +  3*x[2];
con c1: x[1] + x[2] <= 1;
solve;
print x;
run;quit;

View solution in original post

1 REPLY 1
PeterClemmensen
Tourmaline | Level 20

@nep0827, does this represent your actual problem? Any two positive number numbers that sum to 1 will optimize this problem. However, as answered in your previous thread, you can find one of those solutions like this

 

proc optmodel;
var x{i in 1..2} >= 0;
max z = 3*x[1] +  3*x[2];
con c1: x[1] + x[2] <= 1;
solve;
print x;
run;quit;

hackathon24-white-horiz.png

2025 SAS Hackathon: There is still time!

Good news: We've extended SAS Hackathon registration until Sept. 12, so you still have time to be part of our biggest event yet – our five-year anniversary!

Register Now

How to Concatenate Values

Learn how use the CAT functions in SAS to join values from multiple variables into a single value.

Find more tutorials on the SAS Users YouTube channel.

SAS Training: Just a Click Away

 Ready to level-up your skills? Choose your own adventure.

Browse our catalog!

Discussion stats
  • 1 reply
  • 730 views
  • 0 likes
  • 2 in conversation