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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
: u! n0 x7 {- s; z3 M%MMINTERP 1-D Table Search by Linear Interpolation.
  @/ W- ?  ?5 a% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
/ J' I0 o3 j3 o- C" ^3 f% TAB searching for the scalar value VAL in the column COL.
% I  c% s& a& y) h2 l. S1 J* u, Q% All crossings are found and TAB(:,COL) need not be monotonic.
' }: K3 b. t+ Z) E% Each crossing is returned as a separate row in Y and Y has as
% j/ U* N3 T& A$ ?+ R% many columns as TAB. Naturally, the column COL of Y contains
, `- D- b/ O2 ]) d& b) ~: _* ?/ J3 Q% the value VAL. If VAL is not found in the table, Y=[].
* H/ |9 E* F5 U; d" H
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
' m9 T& B/ j0 }. \; h, N( `% Copyright (c) 1996 by Prentice-Hall, Inc.
; X2 a# I6 z' M; o; p% ~
[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
2 u  m* o7 W; C  J* {( Gabove=tab(:,col)>val;
. P0 ?+ S. g2 Mbelow=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
. ]2 g1 ^* R8 d' r# N6 {        return
) }* Y- `+ V8 }' f' x$ z6 send
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
( g2 Y& o% \( z" X) C& E( pnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=sort([pslope;nslope+1]);        % put indices below in order
* W; j, m4 L+ r& via=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
$ h  |' w. `4 [- l% {
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
: ?- C( I0 F% |7 Uieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

+ n; v, |8 C3 r) ]8 oy=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));
- Q5 N9 z3 F- V; w2 j- l1 c$ u5 yy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
( K$ t+ v% I% E) Q/ _9 H
& _, R: D9 L7 W6 O6 Yy(ieq,=tab(ie,;                        % equal values
3 z) N, P. p2 ?0 s/ qy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
' |% F( w7 S+ P5 q) `% TAB searching for the scalar value VAL in the column COL.
4 U4 Y- ~! k* F  U) s/ @3 l' s3 }. z- s9 o% All crossings are found and TAB(:,COL) need not be monotonic.
1 {/ H, q& V  z% 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
0 |, v8 C# P4 w; b3 ]% the value VAL. If VAL is not found in the table, Y=[].
  ]* H: Q4 L3 C4 ?8 D' I6 q
1 B9 H2 u4 q6 \4 G! t/ F+ H% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
3 P6 C/ k9 `  ?7 U% F
2 D0 Z+ ^# m7 ?0 e[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;
/ W& d) J" q: I' X7 u+ G1 e  P# Vequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
' B# a* u1 u/ r! e" F- i5 kend
; z  ^( j1 @1 s4 Y, q6 \+ xpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
$ z4 E9 e8 @6 f$ p; B" F2 V1 @% Tnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
3 ^+ z$ X: a# [' f
ib=sort([pslope;nslope+1]);        % put indices below in order
0 V1 d' S2 {* B  ~2 Nia=sort([nslope;pslope+1]);        % put indices above in order
1 @0 U: K6 }2 K( m8 ^8 Y5 ?ie=find(equal);                                % indices where equal to val
# K* n# I$ o, w2 @& K' t  G
[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

y=zeros(ry,ct);                                % poke data into a zero matrix
% L* g: H2 T0 |& h2 Z
( y6 Y& H% g8 }3 Kalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
6 l2 P+ T/ c1 z( V7 B; [  Ay(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
0 n" Z% O7 Z( P+ E6 t% X
( @8 J4 J+ @5 v; {y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程