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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
) s# ~, y- ]0 P" l8 J%MMINTERP 1-D Table Search by Linear Interpolation.
- ~8 B+ p3 l! X8 R1 Q+ y* |% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
* \. k" N; M4 w- W; {) J% TAB searching for the scalar value VAL in the column COL.
! o% F2 n$ F1 \4 b# d9 o9 X% 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
2 }  d' L% Q$ `, }/ D% the value VAL. If VAL is not found in the table, Y=[].
+ G7 ]; a' F/ W; r
3 m8 y/ b) j+ O9 A, a/ [6 ?$ ]% D.C. Hanselman, University of Maine, Orono ME,  04469
' y0 C* U, k; q2 l: S* V% 1/26/94
7 t9 f" ^: x* L1 S# D, P7 c; F% Copyright (c) 1996 by Prentice-Hall, Inc.

- m7 Y6 x  A5 c9 ?0 v[rt,ct]=size(tab);
; K4 h1 I4 e, O  D, s( E+ ~! j7 }if length(val)>1, error('VAL must be a scalar.'), end
/ j$ @& ]0 O& K* H( hif 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;
( Y: G/ p2 Y( [1 s/ {; Dequal=tab(:,col)==val;
& k: j5 U" C6 Nif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
* I  Q: G9 ?5 K4 v* y5 g/ ^* i! ^3 Zpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
% _& ?2 H( I' inslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
7 w6 g9 B4 N& `! Z4 e9 h
9 \  X" Y" }+ i8 |# V7 i! lib=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

2 F' S; N8 ~/ ~- O. F/ J6 Y! |[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
1 W% ~0 f/ Y9 [( t' O  f+ _& ]ieq=ix>length(ib);                        % True where equals values fit
8 G* n$ R; D0 q, `3 h6 @ry=length(tmp);                                % # of rows in result y
) R+ o0 ^0 ~7 e* W; w
5 R) G7 v8 n4 c% w* ]/ Xy=zeros(ry,ct);                                % poke data into a zero matrix
1 O% F3 k3 h+ t, C& ?
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
0 P! N/ I  l6 ^! O6 ?* f) vy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

( P% K8 s7 N( Dy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
, l& k# \. L0 |. Z! r%MMINTERP 1-D Table Search by Linear Interpolation.
" A  r9 z& }9 ^" z% 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.
% Each crossing is returned as a separate row in Y and Y has as
6 J& z2 ?+ m* s8 B/ T% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
' u7 d. d2 f  Q' Y
8 {: B- K4 t0 y1 z$ z+ E% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

5 U4 C8 P, c. q$ |" m) k+ v: |[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;
: p3 H2 j0 _8 _4 B, r( N1 Y9 ~' nbelow=tab(:,col)<val;
equal=tab(:,col)==val;
# {  F4 P0 _+ o- }9 b( lif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
  {# }3 e" v7 u# G9 _' W; Z  Kend
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
: Z+ t8 f5 g- a
ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
4 {6 N; p" l6 s# B* Bie=find(equal);                                % indices where equal to val

7 }2 L+ c. R9 A, T$ A[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

7 i4 W) ]4 R) M5 C0 D2 O1 Q% K4 Ay=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
  @! _3 K4 K' ~- c* h5 H0 @) [
/ `3 n. x  w# a2 v2 ^+ K- Iy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程