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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
* Z2 q: x4 ~! ~4 `2 V+ v%MMINTERP 1-D Table Search by Linear Interpolation.
5 h7 i# }, s# X8 k% 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.
2 m  U/ u% o8 C- F- X% Each crossing is returned as a separate row in Y and Y has as
3 Z9 F& h' [3 l  N4 A0 m% many columns as TAB. Naturally, the column COL of Y contains
/ l+ u' R4 t) [# D9 c% the value VAL. If VAL is not found in the table, Y=[].

+ f5 z5 u5 E7 F% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
3 }) f+ S8 q/ ^3 q$ v" G+ B: I
, P& \) I) L) T1 e) F[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
* G7 {: i3 [  h  o; p0 Bif col>ct|col<1,  error('Chosen column outside table width.'), end
# \) G! f7 ~6 _- Gif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
6 E& T* Q$ [- j8 g1 k8 Abelow=tab(:,col)<val;
( a4 H! }6 r$ n* X3 oequal=tab(:,col)==val;
/ S3 E) S' o' q; ~if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
; V$ O0 `. E( L# B8 k4 j& M% }nslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
- _, z: ~2 c4 l0 |8 X" g
& L  V# q+ F+ w: {& Pib=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
- ~3 p* i& Q8 n
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
+ C8 Y  @3 u8 L' v5 eieq=ix>length(ib);                        % True where equals values fit
ry=length(tmp);                                % # of rows in result y

0 i6 v  U  t6 a0 _- s. u8 o" ?y=zeros(ry,ct);                                % poke data into a zero matrix
* c6 m. J: R$ S& s7 i  g6 B
" U* Q' `/ |3 Y7 S* v& T5 Malpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
! O4 o! }2 v2 ]+ y/ i& Ty(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
/ j1 P; B) }6 f. Q% \2 r& Y
2 _: Y& F4 g5 ^1 \& Y$ z$ k+ V+ Jy(ieq,=tab(ie,;                        % equal values
+ t. [5 J- J; i" jy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
%MMINTERP 1-D Table Search by Linear Interpolation.
& W: n7 L0 H1 {* N- C" \% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
. h" e9 f6 j3 R. c8 y4 H; Q& Y/ {% TAB searching for the scalar value VAL in the column COL.
4 Y2 {0 y8 i. e( C- d3 S  E/ E% All crossings are found and TAB(:,COL) need not be monotonic.
% x% O- A) M; O% 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
8 ~; M/ K" e8 F- {, l: ^% the value VAL. If VAL is not found in the table, Y=[].

0 \) T7 E0 J8 l0 X. J: L* H% D.C. Hanselman, University of Maine, Orono ME,  04469
1 r5 n: A; W# k! \. l  p( e% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
- I( L- s' T/ Y) R: _
/ W7 n  `) X& z8 X" K[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
& y& p  p9 s! C; d2 c3 I+ rif col>ct|col<1,  error('Chosen column outside table width.'), end
- X/ x1 X) F7 Q% pif rt<2, error('Table too small or not oriented in columns.'), end
% I. n  B+ }. e/ t1 Wabove=tab(:,col)>val;
& B9 y8 N, S: B2 t3 A4 {* q. Ibelow=tab(:,col)<val;
: o4 A- Q8 @' U* u# ?: o0 a9 Uequal=tab(:,col)==val;
& A& ]  D9 m2 ~0 B& wif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
% i/ [4 T0 K. o        return
* B: e5 ^4 z7 W3 N3 q6 D( pend
. K& V8 e6 {( q. w3 P5 E" `( ~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

; d' y8 V; A( Fib=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
- K1 a2 s$ w1 g$ F0 C7 P
[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
  o8 ]/ R& {- y, jry=length(tmp);                                % # of rows in result y
5 x# s  _- a. j; f5 }
& e  y& V8 X; l* Y8 C5 A/ [6 Xy=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
7 c- }- @1 J( f8 B: b& k9 [3 `+ X  jalpha=alpha(:,ones(1,ct));
, {& g, T4 c$ T9 u/ P* S& h3 E/ _6 i  @y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

y(ieq,=tab(ie,;                        % equal values
4 y, N3 h9 Q9 R7 b+ q" }+ x8 ay(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程