运筹学软件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.
0 |: M5 Y) J0 M! x, T% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% [5 s) {$ e# t' N# I* X6 s3 {0 [8 ~% TAB searching for the scalar value VAL in the column COL.
& H- h- X! f$ d  s% u" G% 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
7 h) l1 S0 @# Z  v' Z% many columns as TAB. Naturally, the column COL of Y contains
# Z6 i- I( n3 t3 B+ F% the value VAL. If VAL is not found in the table, Y=[].
8 y, U- `! _; x- S; z: g
# o, y/ k0 d0 `0 Z6 n* G% D.C. Hanselman, University of Maine, Orono ME,  04469
% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

  M; F" f) [1 b! a4 v[rt,ct]=size(tab);
if length(val)>1, error('VAL must be a scalar.'), end
1 ]  m6 s  N. P. ~7 E5 Yif col>ct|col<1,  error('Chosen column outside table width.'), end
if rt<2, error('Table too small or not oriented in columns.'), end
2 U! y5 W! h& B8 G' Dabove=tab(:,col)>val;
below=tab(:,col)<val;
' M. j1 F6 Q, ?! Nequal=tab(:,col)==val;
if all(above==0)|all(below==0), % handle simplest case
) X  b4 V% ~3 c+ }4 c( x, D        y=tab(find(equal),;
4 b' F: \- J1 k$ c/ F% C) L" H5 K        return
end
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
+ F! e4 U# p1 C' inslope=find(below(2:rt)&above(1:rt-1)); %indices where slope is neg

ib=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( q6 Y& G5 b6 v2 G* |+ Q
! H0 N- v( s2 ]! }- l" |, I* Y[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
/ ^0 P8 h, d& j! g2 J! [% L3 Mry=length(tmp);                                % # of rows in result y
% P# I$ v6 {8 q8 _: l3 T
y=zeros(ry,ct);                                % poke data into a zero matrix

: o- T; D1 y. i7 l  I: w7 yalpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values
5 t( ~5 W) k* o9 ]3 K
y(ieq,=tab(ie,;                        % equal values
$ t( M" k8 P( d4 e2 u, X- Ky(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

function y=mminterp(tab,col,val)
% C- v' g& e2 F# T% @%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
: T# w1 e7 z2 D3 A) I8 [% TAB searching for the scalar value VAL in the column COL.
  z; N: I; x7 Y9 G* _  e% All crossings are found and TAB(:,COL) need not be monotonic.
$ a- u  x# V9 k8 N1 q9 p: T- j% Each crossing is returned as a separate row in Y and Y has as
* }9 m# L# i  r9 E% many columns as TAB. Naturally, the column COL of Y contains
) z4 O. j& H% v; C/ ~5 d% the value VAL. If VAL is not found in the table, Y=[].
9 Y! [8 K" o2 D3 {1 C- G* c
) |! Z4 ^' Y3 S# O7 \* h9 r% D.C. Hanselman, University of Maine, Orono ME,  04469
! p5 G: v/ d! j. o% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.

[rt,ct]=size(tab);
- I& H/ {+ v  a8 A7 }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
3 l6 ?* D& G8 p+ {. I4 nabove=tab(:,col)>val;
below=tab(:,col)<val;
3 p' N5 s! ~$ l2 c8 }  A+ oequal=tab(:,col)==val;
& P, y5 R' y' f' l3 `3 Y# Mif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
end
6 c- d+ e) s6 ~0 [$ s; Zpslope=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

3 }$ u" q  e3 Y, ~% Sib=sort([pslope;nslope+1]);        % put indices below in order
ia=sort([nslope;pslope+1]);        % put indices above in order
) [) ]3 q+ V  [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
: m9 `9 o/ r  k4 V. D% lry=length(tmp);                                % # of rows in result y

y=zeros(ry,ct);                                % poke data into a zero matrix

) Z! F0 O% B" v  n% g9 Palpha=(val-tab(ib,col))./(tab(ia,col)-tab(ib,col));
alpha=alpha(:,ones(1,ct));
y(~ieq,=alpha.*tab(ia,+(1-alpha).*tab(ib,;        % interpolated values

y(ieq,=tab(ie,;                        % equal values
y(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程