运筹学软件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
& ~: P0 D7 d; w. f' @0 V! e% TAB searching for the scalar value VAL in the column COL.
/ v" g  M. b. y; I0 K7 M% 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
4 a5 f% b* i- |2 n% Z+ _( R% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
; K9 T) }" \0 }- d# W/ |! I% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
$ x1 B( \( E2 k, a! F1 U( w  Z) v# J
[rt,ct]=size(tab);
' o8 y0 T1 z# T% i6 {8 iif length(val)>1, error('VAL must be a scalar.'), end
# W7 H; {! f% ^: }. {% Z; Vif col>ct|col<1,  error('Chosen column outside table width.'), end
# f  C: ]( c! r1 P. J+ F) {; _if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
* t+ L" K4 m% j8 {6 M; {$ T, mbelow=tab(:,col)<val;
* I/ P5 v. h6 ~& aequal=tab(:,col)==val;
* A/ {( N1 l; F, f8 lif all(above==0)|all(below==0), % handle simplest case
/ q; u7 V: O1 f& w( d, K        y=tab(find(equal),;
        return
end
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

ib=sort([pslope;nslope+1]);        % put indices below in order
" h* W" D2 i# Y) X- A; Aia=sort([nslope;pslope+1]);        % put indices above in order
% O" z3 B8 `* J+ mie=find(equal);                                % indices where equal to val

) f4 L0 M2 O2 G8 R8 u8 W0 j( e[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
% C/ Z( Q* @& `; iieq=ix>length(ib);                        % True where equals values fit
- ?/ v0 E4 T! |, Kry=length(tmp);                                % # of rows in result y

8 m* x" N! M! Q" ?2 ~% Ey=zeros(ry,ct);                                % poke data into a zero matrix

- v" r- g) g, B# @( lalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
  }6 ^1 \- V6 x' M" kalpha=alpha(:,ones(1,ct));
7 [5 s% L% W1 F8 n& }$ Oy(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
" R" U: ]) r3 e$ B) X: @
+ Y: S) R! d: x6 `* r) o5 D  d% ^y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
; w, Y# \$ \9 B* Y1 \) @# I. k- d3 b%MMINTERP 1-D Table Search by Linear Interpolation.
8 R" b! T  h; S9 }& q% 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.
% Each crossing is returned as a separate row in Y and Y has as
; j( K. r6 {! N) c5 p5 J6 d( K' T  n% many columns as TAB. Naturally, the column COL of Y contains
! Z$ M" X+ e0 v% the value VAL. If VAL is not found in the table, Y=[].

# B" P/ R3 ?+ Z7 N7 `; ~! L* ^% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
: [3 h' g4 Q) N) x& T5 A8 l! c% Copyright (c) 1996 by Prentice-Hall, Inc.

5 X# z3 ~' @1 G6 [: ^: V' F[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
if rt<2, error('Table too small or not oriented in columns.'), end
above=tab(:,col)>val;
5 J8 F9 `' i5 f& |1 ~$ obelow=tab(:,col)<val;
equal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
$ ~$ _) T0 q3 U  o+ Q        y=tab(find(equal),;
( ]1 u$ q) y1 C/ i        return
, |$ B8 I* _4 I5 {/ ?% p$ I7 [end
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

ib=sort([pslope;nslope+1]);        % put indices below in order
( @# q: O' X9 Z2 {; ?" `( v4 xia=sort([nslope;pslope+1]);        % put indices above in order
9 I6 E: U8 \9 C' ^ie=find(equal);                                % indices where equal to val

[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
: c2 q* z! ^- \1 g9 n- S
/ B) C3 }" R& D) X) l- `3 ]; T+ J1 my=zeros(ry,ct);                                % poke data into a zero matrix
  ~! F: J/ p  U
alpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
( J  j0 t( H+ F0 |# b7 D% Ey(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

- `) s. r: F6 E: r4 z) N% ey(ieq,=tab(ie,;                        % equal values
( H1 X% t) u0 [, o8 V4 V/ _& d  ^y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程