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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
2 T' K' p# T) l* k% d%MMINTERP 1-D Table Search by Linear Interpolation.
* d) L6 u; a* W- ]- H% 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.
+ |: x) d+ w9 ~6 h2 F8 H/ M% Each crossing is returned as a separate row in Y and Y has as
/ e7 J% _/ x3 w% many columns as TAB. Naturally, the column COL of Y contains
& ^6 h3 {  h& [8 t1 v8 `% the value VAL. If VAL is not found in the table, Y=[].
8 p! I7 c( [$ D9 W4 N* L
8 U+ e, ^3 _) X+ a  ?5 ^" R2 E! j% D.C. Hanselman, University of Maine, Orono ME,  04469
" |  t+ e8 ^3 ?) W" }  H! z% 1/26/94
# U4 B' U3 [% Y  O$ E0 W/ R$ n5 P7 t% Copyright (c) 1996 by Prentice-Hall, Inc.

% P6 @) V% u" F( z0 {[rt,ct]=size(tab);
' d. ^1 B& a/ Eif length(val)>1, error('VAL must be a scalar.'), end
if col>ct|col<1,  error('Chosen column outside table width.'), end
( w5 b; X) I7 l) b5 Yif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
  V- @8 X0 e0 D) ~6 Q9 @* k9 Wbelow=tab(:,col)<val;
$ @7 U2 b0 h6 h  ?equal=tab(:,col)==val;
4 L6 `, b" J3 Mif all(above==0)|all(below==0), % handle simplest case
' O$ {. U/ g7 h- i/ U$ m, I4 N        y=tab(find(equal),;
3 W4 y! g& T. p" P. q/ w        return
end
; W; y3 D( p* Ppslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
1 ~  J, `! E0 q, k7 V4 d4 C  [( Mnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
2 @* m' {+ ?! ]) `' l$ i
ib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
5 i# K5 e! i2 O& d$ ]1 Yie=find(equal);                                % indices where equal to val

: s# m# |+ n. G$ ][tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
9 F7 N4 w( o! w. Yry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix
, N- |" W  ?( u; u; O9 A5 U
  D9 J+ r8 n1 m- [alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
7 A, O) R9 Z) oalpha=alpha(:,ones(1,ct));
  i# S3 H/ f7 l; e7 T6 B$ {; ay(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

# \, V/ Y% D8 b3 ]8 |! py(ieq,=tab(ie,;                        % equal values
* Y9 _1 r  j/ m4 X, Sy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
2 }' v* M' `& D* |%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
; }; F# Q6 G% \% I& ^* @' h: L% 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
: C# j: P  }" B7 B0 a% many columns as TAB. Naturally, the column COL of Y contains
& T, C; C. ]. X  z* {* Z% the value VAL. If VAL is not found in the table, Y=[].
4 B+ D0 U. a6 H& z' Q* O
; n0 `) D- w" m( X% D.C. Hanselman, University of Maine, Orono ME,  04469
9 R* u- M; K: e5 _2 {' e2 \  g% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
; |; Z5 y$ h- J8 d3 m
4 \3 ^& ^6 O; R5 x9 I( f- f7 q: T[rt,ct]=size(tab);
3 u  U( P: }$ C/ W! {0 Zif length(val)>1, error('VAL must be a scalar.'), end
  s& k7 ]: B! \/ |- oif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
below=tab(:,col)<val;
7 K, ?9 T" u; M! t: ]equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
0 T' P) {; ]. s2 ]9 R1 [# Rpslope=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
! c8 t& N# G1 r7 b, ?
ib=sort([pslope;nslope+1]);        % put indices below in order
+ h$ w3 _9 I' H4 }# o8 dia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val

[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
/ x  ?! F, a* b! Y8 Uieq=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
) q# S# }+ S9 W- s, e7 R# [8 \$ \
- c* k) t# V0 a7 N$ G- B% ^alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
6 l5 E) j/ v5 m& h/ }+ r4 s* ]2 _alpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
9 D1 G3 b3 V/ w) v+ k2 S# K
0 w- I* n# t% X. m: oy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程