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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
) p' k4 [  ~/ v' X# S* I2 A4 s% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
. w$ a( _" ?; L& G8 v% W% TAB searching for the scalar value VAL in the column COL.
, b* I7 f8 X  p, g' K9 A4 A, o! h: K% R% 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
% o3 }$ a, Y2 b! k9 ~( e1 A% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
9 y2 C5 F3 \) \* L3 ^" x( t
' g; Y3 |. H) C+ [* k% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
, C& ^. p  ~3 m7 @! r5 x% Copyright (c) 1996 by Prentice-Hall, Inc.

8 l- c8 V! E7 f8 \1 `5 a; p/ 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
0 Q' H& G8 n2 i! _if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
8 z$ `; \* n2 P( }" jequal=tab(:,col)==val;
% a9 M, L( ?* S* ^& \' }5 Yif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
' W5 J3 D6 j3 B        return
& T2 ?7 \6 C  g6 X0 L! ^: {end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
' v7 c: w3 A# h5 @  l& |nslope=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
# @8 T  q' J# R/ r0 q, xie=find(equal);                                % indices where equal to val
5 _  R) S- ?; K
' `; z4 e5 [: o2 ]3 Z2 W) e4 N[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

' K5 v  R8 m4 H0 |y=zeros(ry,ct);                                % poke data into a zero matrix
' R3 W* Z! t, }) b8 e7 \
% }( t/ ]% x* K, c) ~% S1 R) talpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
. b% }  ?) e+ X4 K' l$ zalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

& x( O$ F' P5 Z+ Oy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
4 V9 U8 D! Y* N( v' z1 J" U5 @2 Z%MMINTERP 1-D Table Search by Linear Interpolation.
# L- e7 F8 C, b& m  I  [% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
# @1 G# H; Z4 M8 f% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
% D# l6 z: T! e4 j8 {! T% }% 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
% T5 x4 @7 Y% p1 c! J% the value VAL. If VAL is not found in the table, Y=[].

& Y, Z; u( X% M  u( Y1 s% D.C. Hanselman, University of Maine, Orono ME,  04469
7 t$ \0 @5 r, S( m3 D% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

3 o8 }' F& y- P  ^+ a% q& G[rt,ct]=size(tab);
9 @  I/ D/ f5 e  Z+ mif length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
4 ^8 B$ S& c) y0 \; ?if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
. w) y! v. D3 s/ I$ Cbelow=tab(:,col)<val;
8 N/ S* \, u8 _+ Sequal=tab(:,col)==val;
5 A5 M+ U/ ]0 Z% r  C' Gif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
! b# }4 V, Q5 C- c, U+ Jend
- k2 a  r, p8 M) m* i7 E+ Xpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
* Z5 n+ K! W% x: ^" |8 O% z& B: lnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
; p% G5 w4 f% ~' s5 ~% C" {2 [
8 V0 x$ v/ p( j6 gib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
7 G, Y( {4 a( f, K6 ^ie=find(equal);                                % indices where equal to val
  ]. G: Z7 o, k' N) w& p9 F3 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

( Q2 o, M  w& m" Vy=zeros(ry,ct);                                % poke data into a zero matrix
) `' v: Q# y9 Q. u, L0 Q
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

0 R- m; i! f1 O* K+ K" S) E* ay(ieq,=tab(ie,;                        % equal values
) P; N, G+ J  m& }5 Ky(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程