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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
: R; O# e+ \' b) ?7 y: q%MMINTERP 1-D Table Search by Linear Interpolation.
4 C! n' _! \2 k- B& m8 e% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
  n/ L" Q4 j8 X( y% All crossings are found and TAB(:,COL) need not be monotonic.
+ I& `* F+ r5 x2 _+ d- }( J: E6 ~* w% Each crossing is returned as a separate row in Y and Y has as
# M8 |* G$ u, ]1 v% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
* K  e+ \+ r/ F* ^- G; L
% D.C. Hanselman, University of Maine, Orono ME,  04469
4 v; E5 V3 K* j1 C0 h* f% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
; V4 v( Y1 G, i# P4 Kif length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
; H0 A! q& c4 N& \" N4 ]if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
equal=tab(:,col)==val;
0 l0 e5 ^" G, T8 |if all(above==0)|all(below==0), % handle simplest case
        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 h/ W9 S$ p7 n7 c9 j
, }% o8 _2 k/ B+ l2 z7 B" l3 E4 ]ib=sort([pslope;nslope+1]);        % put indices below in order
3 {5 y1 q# k8 d5 m9 t+ eia=sort([nslope;pslope+1]);        % put indices above in order
+ W/ f8 f# q, J- J; Tie=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
" E* V7 ^3 Q/ p) W) c: ]ieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

) \6 a( Y5 D( u- o/ Ay=zeros(ry,ct);                                % poke data into a zero matrix
4 _* K/ I. m' D/ {5 R% v5 @
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
- v5 D& h9 ^) y! D1 Ralpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

( P$ f" X& u7 v, Q# ay(ieq,=tab(ie,;                        % equal values
. g  g: p$ X8 k8 H0 Hy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
. U5 p: N. O3 D2 R# @%MMINTERP 1-D Table Search by Linear Interpolation.
1 r/ L4 }6 X1 Z6 K) h3 t3 J% 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$ a, v" ?: _2 u9 m1 p8 T% Each crossing is returned as a separate row in Y and Y has as
& z+ B' b0 t/ o9 ]$ Y7 m3 @% s) K% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].

7 ^# i3 e' G; {' O5 g. h% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
- \; ~) Z3 j& p1 X, w1 j7 {+ Z% Copyright (c) 1996 by Prentice-Hall, Inc.

[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
. `* p* s1 G; x) sif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
7 p& U4 r* x0 s  a& c0 L+ b) `below=tab(:,col)<val;
) c. I0 d1 g& h6 G& f& Bequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
4 h8 I; g4 O, a  bpslope=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

) g& [% Y, s; q: y3 a; j- P* Sib=sort([pslope;nslope+1]);        % put indices below in order
6 T0 d8 U6 t# X5 R! w+ y  h4 m( oia=sort([nslope;pslope+1]);        % put indices above in order
# l0 ], S2 \, n" v  z9 Q5 M- vie=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

, X! u' ^3 F7 C  Z1 m( z1 r5 ^y=zeros(ry,ct);                                % poke data into a zero matrix
  s2 [& b% R" i4 p. e" J
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
! l, C# Q- j& `) E. Palpha=alpha(:,ones(1,ct));
! }/ o8 R2 E6 }! v5 Uy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
# b2 ?: c0 E# U! A( \9 V& M
6 h) ~% R6 {1 Uy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程