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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
) s/ W* s6 h' h; |% f/ D6 p%MMINTERP 1-D Table Search by Linear Interpolation.
4 k: U5 s4 n6 C8 q: H) a% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
9 A+ N. ?, A7 L: L% 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
4 A8 S8 D4 x" v" b. j3 r% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
& B, T" D. R! q! c  k  @
- f: u& v  S9 I) S! ~- K% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
- x( p7 z' y" l3 U. W: f; A7 cif 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
. l+ D9 V( L: }3 A" }/ s2 Sabove=tab(:,col)>val;
4 C9 W# j  \2 P% ubelow=tab(:,col)<val;
, t  F- b) {5 ?# e: Kequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
$ R9 Q: N, ?$ \" y$ O9 \        y=tab(find(equal),;
        return
end
4 a$ R( z8 c0 l( i# C2 g3 Ipslope=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
; q7 d  e* e& Q6 e4 i
% [8 g7 w1 U& C$ K; B5 `  k6 ?2 d/ y6 uib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
! s2 t+ k9 F; tie=find(equal);                                % indices where equal to val

+ L3 J3 i  k& t( m0 e: C7 L; u- ][tmp,ix]=sort([ib;ie]);                % find where equals fit in result
& @8 K" T. Z: U( y# M: n" ?6 i5 |5 @ieq=ix>length(ib);                        % True where equals values fit
" ^- q2 \- X. P# i% @8 o5 ~ry=length(tmp);                                % # of rows in result y
. f# v( L1 ~* n( h9 P! B: z# U
y=zeros(ry,ct);                                % poke data into a zero matrix
$ z9 y. H+ c' \  Q4 g) Z
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
+ }% T) u1 ?1 G5 x/ _$ H5 E$ D( Jalpha=alpha(:,ones(1,ct));
% h$ |7 q; L' {2 Y: Gy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
7 f, h' r: x6 b+ y
- ^6 t9 Y; q3 Cy(ieq,=tab(ie,;                        % equal values
  G- W, [" J$ yy(:,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
# y; O: s8 {2 q/ h% TAB searching for the scalar value VAL in the column COL.
1 ]0 O0 o: ~9 l  @0 C9 l- I% All crossings are found and TAB(:,COL) need not be monotonic.
6 ^6 O3 p% A. H. @# g; l% Each crossing is returned as a separate row in Y and Y has as
5 U1 v7 b' s/ V" [7 r% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
. ^# ^1 o, l6 b9 {) g
% D.C. Hanselman, University of Maine, Orono ME,  04469
, ]( y9 O. W0 `& o" D% 1/26/94
9 _0 A9 {0 ]! j6 e3 s% Copyright (c) 1996 by Prentice-Hall, Inc.
% ]8 f8 g/ K2 i' b
[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
, G$ Z4 ^7 [+ A3 Y% pif col>ct|col<1,  error('Chosen column outside table width.'), end
, F7 @4 m8 d7 a7 N. o3 yif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
2 a: R1 t$ B5 \8 X- |( ^below=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
2 ^; S! H, v: H1 s, n  H4 n+ |end
0 P8 A- x8 j" D8 Y3 h  V4 }pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
9 |8 G* v! G0 b$ ?2 U3 G9 X) Cnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
( L- U# ^, N3 C9 Die=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
, z/ o6 D( G# h% c. l- tieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

" g7 R2 C4 o( e7 r! g/ Vy=zeros(ry,ct);                                % poke data into a zero matrix
( m8 o/ G- X- [
0 ]7 c3 [: ~/ d+ E; m4 nalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
4 m' S: T7 H0 |! {7 `7 S4 Oy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
8 _, z9 [1 K* b/ k2 `
y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程