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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
0 y' s) t: A' Z4 S. ^%MMINTERP 1-D Table Search by Linear Interpolation.
* a( _. w  p1 [- _+ c% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
9 s. e$ d8 \2 f' ?% TAB searching for the scalar value VAL in the column COL.
9 ]( m8 S- R  U. p% All crossings are found and TAB(:,COL) need not be monotonic.
$ E7 h+ k+ A% D/ A8 u+ [% 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
% the value VAL. If VAL is not found in the table, Y=[].

: o8 B, O# n" j! U' A% e- C; r! ~% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
& g5 _1 B+ ?( H& R/ W! V0 L. D2 z  x% Copyright (c) 1996 by Prentice-Hall, Inc.

; h, j6 S7 l  o3 B5 T- N[rt,ct]=size(tab);
* l: ~* w& Z" D7 \: r+ ^1 l+ v$ mif 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;
, K/ y6 N6 N: \: I5 ]equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
+ ~2 X8 D# h  Y2 Y4 ^, d, w0 Z        y=tab(find(equal),;
+ |6 `3 _2 A. v: v" u/ [* u2 l        return
end
& `7 g2 R+ ^: t$ ~: Ppslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
6 i% P/ L. P0 [4 ^$ s( s2 unslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
5 G% u0 S+ G" n* W" p
ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
! E1 s: ~( y$ C+ v* q" a
. Y1 o( S7 d- d: {[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
0 ]: b5 q6 N" |- U' j' eieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

. N' k, [/ ?! R) w6 Vy=zeros(ry,ct);                                % poke data into a zero matrix

7 o/ F$ j: l  |3 calpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
- c* a8 \7 u& m; a! @0 Lalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
5 Q0 f3 U, B2 P7 v# ~
y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
" l* _# s1 q$ Q% o% ?8 k%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
' X1 L% T$ M/ _. C/ w! T% TAB searching for the scalar value VAL in the column COL.
% 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
! z+ t( {) q3 @; V9 p: v8 P1 X% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
6 T) h4 h, ~" ~5 x8 d  z
% |0 P5 H# h4 t" |% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

, n9 w9 U% F% f! I& z, N[rt,ct]=size(tab);
5 o6 B! m$ _% }; i) k* aif length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
/ u' J9 P. X$ K/ sif rt<2, error('Table too small or not oriented in columns.'), end
6 E0 h/ }) r! Y7 w+ _* qabove=tab(:,col)>val;
below=tab(:,col)<val;
, q3 E1 C# Z* W% Q. H1 Zequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
( G& H& V/ w# v8 ?7 Z! m        y=tab(find(equal),;
7 y" \5 B/ g) k$ u) h/ s        return
  l+ g8 {% T" z$ T! C" e' B  Eend
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

ib=sort([pslope;nslope+1]);        % put indices below in order
# e5 [! n+ k6 c0 T1 Q5 {4 mia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val

/ f6 b  e+ E3 h/ k0 o[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
* ~4 w, c! k0 E3 h1 X& c- Wieq=ix>length(ib);                        % True where equals values fit
3 ]( t  n9 F. @& x& R7 rry=length(tmp);                                % # of rows in result y

2 ?$ j$ j) z. F9 i9 t8 Qy=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

: `9 ^: m2 U# \) D, s, h" S4 ]y(ieq,=tab(ie,;                        % equal values
2 c+ E& V* ]7 P/ c, K, A) Ty(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程