运筹学软件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.
% o# |! V" [' p% 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
! ~) i+ g8 \7 O" b  G% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
* _  E6 I0 i# ]( c) I+ t% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
! M) y+ W: d- c9 i8 G  n" r$ `  M5 @
[rt,ct]=size(tab);
  n! g9 K. q! T, f2 x$ cif length(val)>1, error('VAL must be a scalar.'), end
  @+ C, k9 }5 t. G) P* p6 ?7 sif col>ct|col<1,  error('Chosen column outside table width.'), end
2 n$ [; w! F2 q8 kif rt<2, error('Table too small or not oriented in columns.'), end
7 C! d# q# u( N6 m3 Xabove=tab(:,col)>val;
below=tab(:,col)<val;
7 X7 x3 M% u* A& uequal=tab(:,col)==val;
) v& ]" z! P6 C! r( kif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
( T6 d6 e6 n( Z3 W1 o9 l        return
end
  }- H( E7 ?+ B( j/ ?1 Epslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
& A+ _' O/ f- e1 n. onslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
$ o/ @9 N$ B7 G$ @3 ?2 T; ?
ib=sort([pslope;nslope+1]);        % put indices below in order
, d0 m* T: o# lia=sort([nslope;pslope+1]);        % put indices above in order
. P0 C$ M: [- k+ C# ]ie=find(equal);                                % indices where equal to val

, Y3 y9 Q! J" w[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
* V2 a7 P, q% }( a8 V3 Xry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix
, }3 W) A9 O/ G2 m3 P
# a+ f' ?1 B2 z" c0 _alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
6 l! u3 l" X$ j$ [' y$ U! N, valpha=alpha(:,ones(1,ct));
2 Q0 \3 R/ s% i# [: g2 |y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

8 o% i$ O! ]; _2 ^% py(ieq,=tab(ie,;                        % equal values
% u% q/ M( n# Y8 D5 D- U3 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
% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
( U1 u. a+ p% K3 O. m1 ^; `% Each crossing is returned as a separate row in Y and Y has as
; O  L  A% |5 p8 w  h% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
: _4 Z2 ~, `5 S, ?0 j  m2 z9 a! s
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
1 l  b- C5 j# }* \9 Q% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
3 g3 w4 n! c  J3 D, M1 z9 aif col>ct|col<1,  error('Chosen column outside table width.'), end
+ k5 L1 s0 ^& r& ?( \7 Eif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
# e) n, |0 L+ T% R" y: a& x/ Vbelow=tab(:,col)<val;
: f+ d& j7 ]: s, Bequal=tab(:,col)==val;
/ v: T3 ]! I$ a  k* }2 vif all(above==0)|all(below==0), % handle simplest case
, J' W2 b& c% J        y=tab(find(equal),;
% a& k* ]. V, i' L2 U8 |        return
2 _9 Q; _  ^8 s% T6 r" Pend
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
2 t5 I# X0 i. f5 ]: wnslope=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
ie=find(equal);                                % indices where equal to val

) Q* ~% l/ Q$ C* n* p; p! e[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

) E6 K" C/ C! P4 Nalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
0 ]9 ?0 j  {6 H9 O5 xalpha=alpha(:,ones(1,ct));
# n1 w" H* ?8 V6 X2 ~7 fy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
* l9 u5 m% V, @0 p9 b$ n0 T
" v/ @) h2 O3 [2 U7 f) Wy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程