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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
# Q2 z: B- f7 U/ L; e%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
3 F  g* x5 O" @4 Z& I1 M1 d, Z/ B% TAB searching for the scalar value VAL in the column COL.
% All crossings are found and TAB(:,COL) need not be monotonic.
# |8 p5 V. p# C, z8 f+ U5 f3 p: [3 N% 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=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
! o* b9 I; p% I% 1/26/94
' ]4 s& [" \  I  L7 n( e% Copyright (c) 1996 by Prentice-Hall, Inc.
) C2 B/ S( g7 @  |& i2 [
[rt,ct]=size(tab);
+ [5 b' A9 s0 i( Uif length(val)>1, error('VAL must be a scalar.'), end
* q9 S- W6 @; y0 z; h' z. }if col>ct|col<1,  error('Chosen column outside table width.'), end
+ G  D! d7 w( B. I* W2 k3 O2 jif rt<2, error('Table too small or not oriented in columns.'), end
, I  d$ M7 z- F# f% uabove=tab(:,col)>val;
0 ~2 r7 J* T2 R2 _) O! @' X: h$ Wbelow=tab(:,col)<val;
  t. Y- ]+ C7 w& t0 r- Sequal=tab(:,col)==val;
) c, H+ [4 F' K( tif all(above==0)|all(below==0), % handle simplest case
$ P5 [2 z( h7 q/ o7 l3 r        y=tab(find(equal),;
        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
% {8 E9 |. w; e/ q: A% m, d7 H. |1 mnslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

' \5 ?# b, m+ i% ~1 Y4 S. Zib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
1 O1 x. y& N. V/ D) q. nie=find(equal);                                % indices where equal to val

0 J  a! _; \$ S# J# F4 B: R[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
/ H1 j1 t! J# X$ ]  O. |. hry=length(tmp);                                % # of rows in result y

; f' y$ F8 ~2 T+ q3 Ty=zeros(ry,ct);                                % poke data into a zero matrix

alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
, a( ]2 s; D' zalpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
2 m; Y! X3 g3 N8 B! |" H
y(ieq,=tab(ie,;                        % equal values
- E- ^1 a# H7 H2 c! {5 ~y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
( K2 _. k' z$ z5 M! Q" {%MMINTERP 1-D Table Search by Linear Interpolation.
+ V. _+ F2 B$ e& E% 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.
' M8 i* R# H3 n6 m' V1 p# E% 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=[].

; [( k. E0 q( d" O* ]8 H5 V7 |1 C& C% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
5 g# w7 f# p0 n# U2 z
[rt,ct]=size(tab);
5 w, U$ \" C' E6 n- v4 O- S% hif length(val)>1, error('VAL must be a scalar.'), end
! O' T, ~1 H# c/ W+ Jif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
: X7 m6 V7 W+ [+ eabove=tab(:,col)>val;
$ q& u$ }8 y/ K* kbelow=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
$ N6 o. _' f5 F2 O( o4 D2 E        y=tab(find(equal),;
        return
: q5 j$ Z9 {2 H, B+ J/ f0 R  eend
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
; }7 N4 B% B) ?" G) h/ p! a- l
- n& }, L$ Z6 p) I. Wib=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

- |9 w7 z9 K3 a4 O! ^! e" |+ I[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
; J, S, a) a- [0 L4 l/ U" ]ry=length(tmp);                                % # of rows in result y
2 Z! f: n: t& w$ L0 E
y=zeros(ry,ct);                                % poke data into a zero matrix
( {: f5 P6 Z+ w3 t0 l
$ y9 R2 z4 A3 zalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
8 V9 u% E) s" M5 I3 A$ F( E% F; y9 Salpha=alpha(:,ones(1,ct));
6 n  d5 t$ u2 q2 a+ h4 _y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

$ @9 P: a0 s5 Q5 ?y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程