运筹学软件lingo9.0下载（带附件）

mathtake

共享，有需要的下。求解线性规划最好用的软件。

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

就在这个网站上面有Lingo11的破解版，无限变量！！

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
/ r: l/ g  I1 U8 |+ V5 L% Each crossing is returned as a separate row in Y and Y has as
3 h; |' {% _2 N7 j5 U6 Z% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
+ i( ?8 M3 \  Y  a: w$ P  T' s
( o) y! f$ p) ]+ m% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
0 [7 s1 K% W* D3 K+ ?4 f% r- W1 \  V
& d$ }2 k" P6 p3 g4 h[rt,ct]=size(tab);
6 M3 p# _7 Z4 O# ^9 wif length(val)>1, error('VAL must be a scalar.'), end
: |2 Y  H4 M) _& V  G  Eif col>ct|col<1,  error('Chosen column outside table width.'), end
# t: _: z/ D, b* ]if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
6 t+ e- d% K' w* V, @) ?$ w7 \, Oequal=tab(:,col)==val;
' U2 p4 z: P$ p( V: Z) M/ `3 M6 {if all(above==0)|all(below==0), % handle simplest case
( B* v& h( v  _# ?        y=tab(find(equal),;
        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

1 J7 W5 z6 t% ]0 q* I1 d9 |ib=sort([pslope;nslope+1]);        % put indices below in order
3 r7 s! F3 c8 K& oia=sort([nslope;pslope+1]);        % put indices above in order
. }% k6 T$ F, ?' r& b: Fie=find(equal);                                % indices where equal to val
6 r" c) [4 M  c# z
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
1 W$ g) ~( N5 @" v4 d6 r2 Iry=length(tmp);                                % # of rows in result y
7 c) w$ }. {5 \2 }/ B  t' n
y=zeros(ry,ct);                                % poke data into a zero matrix

) u. [4 p4 O7 p* F7 @$ I6 b- F' valpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
. _* f, }  j* p4 v1 e) @  K+ B7 Salpha=alpha(:,ones(1,ct));
, |: J  Q* v& Q* O' Qy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

: Y: |" |) \( `! x& zy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
/ c1 T$ E( m5 n3 J8 `%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
6 \/ c) r/ y$ t- C" `% All crossings are found and TAB(:,COL) need not be monotonic.
% Each crossing is returned as a separate row in Y and Y has as
% many columns as TAB. Naturally, the column COL of Y contains
" O; ^) D6 t* i! }8 S% the value VAL. If VAL is not found in the table, Y=[].

7 E6 [2 J% q* M. x$ K! Q% D.C. Hanselman, University of Maine, Orono ME,  04469
9 \5 W* @) o, z6 z+ m0 Y, U" |% 1/26/94
. |5 p& }! @  o/ E) j2 N  Y1 C$ [/ |- Y% Copyright (c) 1996 by Prentice-Hall, Inc.
. r8 v2 @& ]6 D- n3 F* N7 [' |
[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
6 |, N% c% S: U# F9 v+ x# cequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
" U2 ^8 W4 z; D& ^) F& Gend
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
0 E7 Q! n- b: |! y: w+ m) `
0 i1 ^, }, }9 y3 A) p6 Eib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
/ a, l, c) p! A9 G$ N5 ?ie=find(equal);                                % indices where equal to val
% Z9 V+ a" g. [1 }( D+ J
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
1 T2 |; ]* E9 _" \- u8 ?* uieq=ix>length(ib);                        % True where equals values fit
/ Z3 r7 [; |6 t2 P% t8 J9 ?+ y8 X* |ry=length(tmp);                                % # of rows in result y

$ [# Q) p% z. v4 |y=zeros(ry,ct);                                % poke data into a zero matrix

  ]! a5 m9 p  G* ialpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
: A9 d- ^$ }3 E% \' [2 a& Ly(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

y(ieq,=tab(ie,;                        % equal values
3 F( T( Q  W- u1 D" yy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程