scientific article; zbMATH DE number 3912092

From MaRDI portal
Publication:3688090





[For the entire collection see Zbl 0567.00002.] Many problems of optimization are essentially multiextremal and treating them as uniextremal ones is rather shortsighted. In fact, every optimization problem should be treated as multiextremal unless the opposite property is proved. Some special techniques could be used (for instance, dynamic programming or branch-and-bound techniques), as well as the universal random search. Several practical problems were successfully resolved; however, they were initially of or had been reduced to small dimensions, not greater than ten. As for problems of greater dimensions, no one has, as yet, offered an efficient technique. It is sensible to test the interactive systems that have proved efficient in the similar problem of resource allocation for net planning. However, the problem of rational task subdivision between a computer and an operator then arises.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3688090)