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

mathtake

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

mathtake

这次终于有了。

szr13132008

有没有license key？

mathtake

有，是破解版的。

371568491

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

majiancumt

lingo 与mathematica

majiancumt

lingo  教程

majiancumt

function y=mminterp(tab,col,val)
3 S2 m6 J/ R  s* Z( O2 K%MMINTERP 1-D Table Search by Linear Interpolation.
% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% n1 ~' c9 \! T: Z% TAB searching for the scalar value VAL in the column COL.
% _7 x# b/ T0 V0 c# b' B% All crossings are found and TAB(:,COL) need not be monotonic.
  J9 o" a+ t4 I! `4 F, W% 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
, [- N1 ]1 ?/ G( i& v% 1/26/94
3 u3 Q# I# H; C1 V, K* _' `% Copyright (c) 1996 by Prentice-Hall, Inc.

0 f: r" J7 T9 {. D; J3 n[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;
below=tab(:,col)<val;
5 |$ G' h+ R6 f. L8 I3 D# |equal=tab(:,col)==val;
( @/ ^5 U* r5 v* [% xif all(above==0)|all(below==0), % handle simplest case
        y=tab(find(equal),;
        return
& Z" J6 U* h" G* j+ |% S! k% Hend
pslope=find(below(1:rt-1)&above(2:rt)); %indices where slope is pos
$ w$ e7 t* Y2 C# F2 [5 Jnslope=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
5 f  D4 X6 g+ ?
& ?# R9 K2 H, X, s* m. z% h7 B[tmp,ix]=sort([ib;ie]);                % find where equals fit in result
ieq=ix>length(ib);                        % True where equals values fit
: F1 N# k' H5 L; A# e! p# Iry=length(tmp);                                % # of rows in result y

5 M% G2 z. {6 E1 C6 T, `3 ny=zeros(ry,ct);                                % poke data into a zero matrix

& n( Z% Z7 N, L2 f, K" ^3 q+ }# {2 [alpha=(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

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

majiancumt

function y=mminterp(tab,col,val)
$ s1 c$ l& P9 q9 z2 w: f+ q; Y' p%MMINTERP 1-D Table Search by Linear Interpolation.
8 o3 x0 z6 p- l  _- r4 y3 J! a- i% Y=MMINTERP(TAB,COL,VAL) linearly interpolates the table
% TAB searching for the scalar value VAL in the column COL.
; X3 T) u" V2 q' T! J6 [. _, 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
* ~  Y0 v6 m- A3 \% many columns as TAB. Naturally, the column COL of Y contains
$ j! E; Y3 L& H3 A  \# p0 f% the value VAL. If VAL is not found in the table, Y=[].

% D.C. Hanselman, University of Maine, Orono ME,  04469
  @' d# r$ `& K* G6 Z7 }  t% 1/26/94
% Copyright (c) 1996 by Prentice-Hall, Inc.
9 w/ |8 e0 W! C" P
6 w& A# C' c2 W0 N' n* r[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
5 k7 c( V# F5 y- Jif rt<2, error('Table too small or not oriented in columns.'), end
- j* o% r6 J! d- @: m. C$ Nabove=tab(:,col)>val;
below=tab(:,col)<val;
# \8 J* _5 t0 {: H6 }  yequal=tab(:,col)==val;
3 Z, |7 L, A2 b" tif all(above==0)|all(below==0), % handle simplest case
2 j( G, J9 O# S9 c3 X6 w" c& U        y=tab(find(equal),;
        return
; [4 v2 h, d2 F# a  x8 f- h: D) L6 xend
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
' K" l4 C# B* `5 T) X
. w- D0 T' V+ a! _ib=sort([pslope;nslope+1]);        % put indices below in order
" E- Z$ o% ]( S% B1 pia=sort([nslope;pslope+1]);        % put indices above in order
ie=find(equal);                                % indices where equal to val
4 V; f2 A+ N( M
" v- J9 S1 C" G  H9 I0 r( ][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

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

alpha=(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
" e0 P8 a3 F' p/ S* _) w9 W! cy(:,col)=val*ones(ry,1);        % remove roundoff error

majiancumt

lingo 教程