× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



I'm still trying to figure out what's wrong with partial payments. Besides
being "neater." Even after going through all of the permutations there will
still, at least occasionally, be partial payments.

Just seems like a lot of bother for little benefit.

Jerry C. Adams
IBM i Programmer/Analyst
If you live life without any regrets, you're doing it wrong.
--
NMM&D
615-832-2730

-----Original Message-----
From: RPG400-L [mailto:rpg400-l-bounces@xxxxxxxxxxxx] On Behalf Of Booth
Martin
Sent: Tuesday, September 30, 2014 12:07 AM
To: RPG programming on the IBM i (AS/400 and iSeries)
Subject: Re: Combinations & Permutations..... sort of

Having faced this problem of applying payments to outstanding invoices, in
the end I found that the best first try was to group invoices by billing
period. The second try was to start with most recent billing period and
working back towards the old items. Since most customers paid their bills
once a month, that proved to be pretty effective.
There are very few partial payments; the ball-ups generally were with
disputed bills which gravitated to the past due columns.


From: roger.harman@xxxxxxxxxxx
To: rpg400-l@xxxxxxxxxxxx
Subject: Combinations & Permutations..... sort of
Date: Mon, 29 Sep 2014 17:17:55 -0700

Put your math hats on......
I'm looking at a means to *attempt* to auto-match payments to
invoices. We do not want to apply payments to oldest first and end
up with a partial payment or credit leftover.
Pick an arbitrary number of invoices for the attempt - say 10.
Any combination of 1 or more of these 10 invoices that total the
payment amount would be considered a match.
Could be invoice 1, or 2, or.... Could be invoices 2 and 5 and
8..... etc.
I assume it's going to have to be a brute force approach but I'm
stumped on the total # of possible matches. Combinations &
permutations I understand (3 out of 10, etc) but this "1 or 2 or (1
and 2) or (2 and 5 and 8)" is giving me a mind block. I do know
it's a big number and I'll likely cut back the sampling size.
Any suggestions or clarifications would be very welcome.
Thanks.


Roger Harman


COMMON Certified Application
Developer - ILE RPG on IBM i on Power

--
This is the RPG programming on the IBM i (AS/400 and iSeries) (RPG400-L)
mailing list To post a message email: RPG400-L@xxxxxxxxxxxx To subscribe,
unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives at
http://archive.midrange.com/rpg400-l.


As an Amazon Associate we earn from qualifying purchases.

This thread ...

Follow-Ups:
Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.