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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
# [5 Q5 ~$ H; U7 Q& O( Y%MMINTERP 1-D Table Search by Linear Interpolation.
" y( O/ a7 h. x% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
+ ]$ s3 D+ T2 E' }3 |. w) z# f: E% 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
% many columns as TAB. Naturally, the column COL of Y contains
% the value VAL. If VAL is not found in the table, Y=[].
. T0 d( i  `: Y. p& W9 Y
& S) U% @, ]/ l% D.C. Hanselman, University of Maine, Orono ME,  04469
+ l1 {1 d# }0 t7 g) Z+ ~9 P4 u% 1/26/94
2 n% }3 `: `3 v' H% Copyright (c) 1996 by Prentice-Hall, Inc.

1 {& q% |3 V0 o5 C6 b- [. i[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
9 f% z5 y& f+ O, Q& |+ \+ kif rt<2, error('Table too small or not oriented in columns.'), end
, y* r0 F+ {: B. q; Fabove=tab(:,col)>val;
below=tab(:,col)<val;
: i/ q4 O# L& ?, m6 J" w1 Xequal=tab(:,col)==val;
* h: `( [& ]6 ~; u" I2 J" mif all(above==0)|all(below==0), % handle simplest case
7 A/ D* w+ `+ p8 @1 j' P        y=tab(find(equal),;
9 {7 D8 ^$ c6 V4 G0 Z        return
+ y. q% c' V% u3 r5 |# gend
0 b0 L' t* C: p2 ppslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
$ h/ F( h4 K3 Q1 p6 S3 Y3 Cnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
, P7 e3 b5 I" c/ u4 M, ]
& L9 Y+ C/ E- W) dib=sort([pslope;nslope+1]);        % put indices below in order
* r- M$ L7 j$ U  y$ j/ b5 \% dia=sort([nslope;pslope+1]);        % put indices above in order
- z; d1 `3 Z0 k( u; Sie=find(equal);                                % indices where equal to val
, [# P6 N  `  i. ?
( }. [/ D! N8 O$ R2 D[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
/ B6 ?  D# i( J1 R0 ]ieq=ix>length(ib);                        % True where equals values fit
/ q# f  K+ I0 j8 Xry=length(tmp);                                % # of rows in result y
& ?8 P9 M/ f. ^/ j/ d( I8 H4 Z1 M
, E' p& J) ]/ x1 u5 Y2 Gy=zeros(ry,ct);                                % poke data into a zero matrix

1 S3 D- ?$ X; _0 L) n6 Zalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
; T$ r% Y* R- H$ s9 ~! Yalpha=alpha(:,ones(1,ct));
  d$ J3 O; e; O( @" }3 l' t$ |y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

y(ieq,=tab(ie,;                        % equal values
" r  g0 z* J8 F& m: E' z7 j4 u5 oy(:,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.
# _2 Z( E: I) k2 U# w9 ~; |& P% All crossings are found and TAB(:,COL) need not be monotonic.
& P0 t/ l" {# H: ?% Each crossing is returned as a separate row in Y and Y has as
6 [3 P% H2 q2 b% 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
% 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
4 o* y" G2 b1 i2 cif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
# X# n* R* x: e; _4 {above=tab(:,col)>val;
below=tab(:,col)<val;
equal=tab(:,col)==val;
. u( C8 D7 X- }( C$ T: vif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
5 i& C! Y* \: H% e8 |        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
& j6 h7 K# E$ h/ Vnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
' _! X/ y: }) v
ib=sort([pslope;nslope+1]);        % put indices below in order
! h3 |& P* x. P% k: G5 A1 ]) Mia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
8 O7 }& w6 i0 Q' ?) w2 }
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
: D& ?2 C" I- R/ s2 p# i3 Aieq=ix>length(ib);                        % True where equals values fit
9 k: E( @& I( K/ c- U; Mry=length(tmp);                                % # of rows in result y

$ [+ ~* d: I, b( ~( J9 dy=zeros(ry,ct);                                % poke data into a zero matrix
- S8 a- A) f( x3 V
: L( h3 P; k1 E+ Q8 `; ~6 Oalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
4 I) H( Y7 i: P; D; f) Xy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

/ h' J5 `3 f( [y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程