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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
7 \  T0 {  _6 e$ G( @%MMINTERP 1-D Table Search by Linear Interpolation.
& b# z+ O0 ^9 U0 c% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
5 k. j' W7 O7 r' i9 M$ E% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
! j0 D3 e  A8 t/ C* K% b6 ]% 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
% the value VAL. If VAL is not found in the table, Y=[].
2 P7 _  o, I8 h+ f% V
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
$ g; B3 a6 [' ]% L0 C$ B8 F
[rt,ct]=size(tab);
, N4 H% n4 }. l  S9 Bif length(val)>1, error('VAL must be a scalar.'), end
  {8 z" A. ~# [) `7 Wif col>ct|col<1,  error('Chosen column outside table width.'), end
+ a+ Q+ a- Q2 }9 z0 b! ]if rt<2, error('Table too small or not oriented in columns.'), end
0 s3 a6 I, q( M% I+ eabove=tab(:,col)>val;
  V7 E' h: {( n% Q1 Z- t( ~7 Bbelow=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
) f% R; w+ n3 G9 Mpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
: j, V) `; F! B/ y/ qnslope=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

" w; \! m# O7 ]- R4 y/ i! q[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
8 h; @! R7 R' l" ?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
) p2 x1 r: {7 \7 F
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 K' ]5 n& ^% N( \5 v* e1 B2 A
9 E) @8 ^2 B5 [2 H4 f- L3 G0 fy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
2 }9 r5 D5 H* u. X%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.
$ z5 k; z5 E7 b2 y( n4 I% L% All crossings are found and TAB(:,COL) need not be monotonic.
6 L. X$ h* f/ |% 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 b& b% W: T, W: x6 O; S5 O4 K8 b% the value VAL. If VAL is not found in the table, Y=[].

0 t' x) ]6 b, ?7 `% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

[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
! r. }& _' ]$ R$ mif rt<2, error('Table too small or not oriented in columns.'), end
/ s, J6 G% n: t. {6 z! oabove=tab(:,col)>val;
# W9 o$ M* L! w. s8 c  r0 Hbelow=tab(:,col)<val;
equal=tab(:,col)==val;
. U+ y, S( t: Z: ~- y/ b$ vif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
" O# `7 k' S. |# F& M" C+ J        return
8 q. [# J; @6 q6 D1 y0 e. Zend
9 [  Y$ H( g+ q, ~* apslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
& R4 p& ^' I! E7 d" Qnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
# s5 X$ _" H0 _; C! q4 U
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

; H, S" D1 ^; b[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
0 b& c7 g! L/ X- @' q( R* e% O
y=zeros(ry,ct);                                % poke data into a zero matrix

9 M' z3 {9 P+ e5 |6 Halpha=(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
  K) ?0 P; x& U. g
, _" n( Q/ G/ X+ }: r& m) my(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程