运筹学软件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.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
0 k  d  {  {; ^$ x6 R9 b, q% 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
) p6 @. x+ }  u* m8 e/ h% 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
# J4 t  N6 N2 A% Copyright (c) 1996 by Prentice-Hall, Inc.
3 D/ ]/ ?( b' Y( r
  ~$ `( A# U1 Q: O[rt,ct]=size(tab);
4 O0 L" W' |7 d7 Z- Q4 mif length(val)>1, error('VAL must be a scalar.'), end
; b+ l9 {, Q- g/ \) u; b! Y: u' Sif col>ct|col<1,  error('Chosen column outside table width.'), end
: R1 F$ B" g6 E, m! F% k; s' zif rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
  D" ?+ M: S' b7 fbelow=tab(:,col)<val;
equal=tab(:,col)==val;
) ]: q- `2 z( i, B: Eif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
# O% T2 [; m3 ^; n  I: send
8 M0 R6 D- m/ K1 }( [! s+ R( c( zpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
- c& v6 h8 s6 t: f% F# t8 Pnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

2 k3 X7 }" ]' C' u/ T, ?8 Y7 g0 zib=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

$ z( g) l' `6 K3 U; ~1 S. t[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
, Z, i: D0 @6 M1 t5 U! V- ~ieq=ix>length(ib);                        % True where equals values fit
/ O0 k* K( J9 k- ^5 I0 h2 }* ?7 {ry=length(tmp);                                % # of rows in result y
8 W9 ?7 t2 X7 ^0 F. p, P" O  ?
- d8 a! l6 G) V; }0 g6 my=zeros(ry,ct);                                % poke data into a zero matrix
( O0 w' P! g8 b! s' ~2 }8 V
/ Z8 B4 c& b# N+ v* Palpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
7 e* }) v/ }6 L/ W1 K" xalpha=alpha(:,ones(1,ct));
: S$ Y0 q$ m# P* I6 \8 ty(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
$ G) o! h1 F! X/ e2 O- G6 H) c9 W1 J1 w
. U) p) D- e* l( }& X, r" M, M$ gy(ieq,=tab(ie,;                        % equal values
+ B" u) m6 I% U5 I  z8 y- F/ Py(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
9 A- m1 ?& _$ ?$ H) u$ {. i) J%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.
& o, l( C% r. \. u! f% 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
' |: L% s6 H, i) |( |8 R% the value VAL. If VAL is not found in the table, Y=[].
* ]" H* t+ b. Y" M& R' }
% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

) h1 }5 [8 N* j[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
& l, z! r3 H" Tif 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;
" Q4 X* H: F3 F( v1 s1 l/ Lbelow=tab(:,col)<val;
8 ~( W# N: w* W1 P4 a! a! Kequal=tab(:,col)==val;
  ~9 N0 a7 {; j( \! a% ]if all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
4 Z$ M; p7 k* u        return
end
1 a2 X% p+ s' vpslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
/ ]- T  W, I: E, Y% znslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg
2 B$ Z( J: R1 \! g9 `6 p
ib=sort([pslope;nslope+1]);        % put indices below in order
& \" a8 r1 A# L4 tia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
& O4 y8 q* i9 A' t( B
6 E7 X/ N# N6 L8 _0 G[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
/ D1 U; H3 }# d3 ?& }' I0 ~
2 G) P" z5 C% T9 P' i' O3 J3 qy=zeros(ry,ct);                                % poke data into a zero matrix
9 H" z1 U5 ]' B
( }; U0 A5 S/ S/ V7 ]3 I8 halpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
. J; ^7 T% l$ Y  `9 \: G# q0 iy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
: r% V" @% {: Z  u
4 S. I1 @% `) {; y/ wy(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程