Joseph Rushton Wakeling <joseph.wakel...@webdrake.net> writes: > For example, if you've got a 100-page full orchestral score, is it > really appropriate to do a global optimization of the whole thing?
Sure. > How mutually dependent, really, are the first and last pages? Not much, usually. And that's what linear programming is usually going to arrive at. > Isn't it possible to break the work up into manageable smaller units > even in the case that it's 100 pages of continuous music? Linear programming breaks up the work into manageable smaller units. The units are not separate bunches of pages but rather independent breakpoint sequences. > It's not just about how many cores you can use, in fact that's > probably a minor issue compared to: > > -- Largest possible memory consumption and/or calculation size. Is it > capped or does it scale in an unlimited way with score size? Scales with score size. It would be challenging to create output on-the-fly, namely whenever all optimum breakpoint sequences share common starting sequences, and it would depend on the absence of forward-references (like page references and stuff). -- David Kastrup _______________________________________________ lilypond-user mailing list lilypond-user@gnu.org https://lists.gnu.org/mailman/listinfo/lilypond-user
