Home > Archive > APL > May 2007 > linear programming
You are viewing an archived Text-only version of the thread.
To view this thread in it's original format and/or if you want to reply to
this thread please [click here]
| Author |
linear programming
|
|
| Bakul Shah 2006-12-21, 6:57 pm |
| I stumbled upon Iverson's concise depiction in APL
of the simplex algorithm for linear programing and
that got me wondering if there is such a thing in K.
Or J but I don't grok J too well as yet. Further,
if anyone has an interior points method solution in
APL, K or J. If so, I'd very much like to see
these solutions. I don't need them for any real
work (for that I'd just use lp_solve or something);
I am just curious. Thanks!
| |
| Philip A. Viton 2006-12-21, 6:57 pm |
| In article <458afb7f$0$69017$742ec2ed@news.sonic.net>,
usenet@bitblocks.com says...
> I stumbled upon Iverson's concise depiction in APL
> of the simplex algorithm for linear programing and
> that got me wondering if there is such a thing in K.
> Or J but I don't grok J too well as yet. Further,
> if anyone has an interior points method solution in
> APL, K or J. If so, I'd very much like to see
> these solutions. I don't need them for any real
> work (for that I'd just use lp_solve or something);
> I am just curious. Thanks!
>
The current J distribution comes with an implementation
of the simplex method (in its system/packages/math section).
--
Phil Viton
Ohio State University
| |
| The Incredible Nadger 2007-01-06, 7:01 pm |
|
Bakul Shah wrote:
> I stumbled upon Iverson's concise depiction in APL
> of the simplex algorithm for linear programing and
> that got me wondering if there is such a thing in K.
> Or J but I don't grok J too well as yet. Further,
> if anyone has an interior points method solution in
> APL, K or J. If so, I'd very much like to see
> these solutions. I don't need them for any real
> work (for that I'd just use lp_solve or something);
> I am just curious. Thanks!
Way, way back in the mists of time one of the first APL systems I
worked on was the famous Colman Foods Honey Blending program, at the
heart of which was the old Sharp APL workspace 43 LINPROG.
The system was used to create the two blends of honey, clear and
crystalline, from various batches of raw honey. IIRC there were 12 or
14 objective variables and about 30 constraints. The program calculated
both blends together to make the best use of the available stocks of
raw honey. I enhanced the original to include a stock control system,
with all the parameters for each batch of raw honey already stored, to
cut out the need to enter them all, and then rdid a rounding adjustment
so that the workers on the factory floor only needed to use an exact
number of drums of the raw honey from each batch.
I believe it was written up in one of the APL Conference proceedings
aorund 1980.
John Warden
| |
| phil chastney 2007-01-06, 7:01 pm |
| The Incredible Nadger wrote:
> <snip>
>
> Way, way back in the mists of time one of the first APL systems I
> worked on was the famous Colman Foods Honey Blending program, at the
> heart of which was the old Sharp APL workspace 43 LINPROG.
> <snippped again>
>
> I believe it was written up in one of the APL Conference proceedings
> around 1980.
that would have been Ted Burnside at the IPSA conference in Toronto
1979? . . . /phil
| |
|
| On Dec 21 2006, 4:24 pm, Bakul Shah <use...@bitblocks.com> wrote:
> I stumbled upon Iverson's concise depiction in APL
> of the simplex algorithm for linear programing
can you point me to a citation or reference where I might get a copy?
| |
| Markus Triska 2007-02-02, 6:57 pm |
| "TC" <tclviii-gg@yahoo.com> wrote:
> On Dec 21 2006, 4:24 pm, Bakul Shah <use...@bitblocks.com> wrote:
>
> can you point me to a citation or reference where I might get a copy?
K.E. Iverson, “The Description of Finite Sequential Processes”,
Proceedings of a Conference on Information Theory, C. Cherry and
W. Jackson, Editors, Imperial College, London (August 1960)
URL: http://keiapl.info/eemcd/keisimplexpages/
All the best,
Markus Triska
| |
|
|
> Proceedings of a Conference on Information Theory, C. Cherry and
> W. Jackson, Editors, Imperial College, London (August 1960)
> Markus Trisk
thanks
| |
|
|
|
|
|
|
|
|
|