home Other disciplines Books Mathematics programmers - Nakonechny S.I.

Mathematics programmers - Nakonechny S.I.

6.3. The characteristic of the method in the study of the number of problems of linear programming

For the knowledge of the optimal schedules of problems of numerical programming, zastosovyot soi grupi metodіv:

1) the exact method:

• Method of revision;
• Combinatorial methods;

2) the approach to methodology.

The basis of the method of visualization is the postural "sound" of the region of permissible rozv'yakіv rozglyadovannoy tasks. Poshuk tsilochislivogo optimum to begin with rozv'yazuvannya zadachi z so zvanymi indulgent obmezhenni, tobto without uraikhuvannya vimog tsilochislovostі zmіnhnih. Dali introduced to the model of specials dodatkovyh obmezhen, shcho vrahovuyut tsilokchilist zmіnnikh, bagatogrannik permissibles rozv'yazіv poslablenye zhizni postupovo zmenhshut dotsi, docks zmіnni optimal rozvyaku not nabudut tsilokshislovy znachen.

Up to the group of lying:

A) the method of rozv'yazuvannya povnistyu tsilokshilovyh tasks (shotgun algorithm Gomory);

B) the method of rozv'yazvannya chalkovo tsilokshilovyh tasks (another algorithm Gomory, abo zmishanii algorithm tsilochislovogo programmvannya).

Combinatory methods of qualitative optimization are based on the search of all permissible numbers of individuals, one by one, by the procedure of the procedure, the identification of individuals is limited to small parts of roses.

The method of glycol and intercalation is used in the group of methods.

Починаючи з розв'язування relaxed tasks, він perebacha поділ початкової problems in two directions through the exclusion of the regions, but not to melt the number of roses, and the delivery of the skin part of the bagatohedra of permissible rozvozyiv.

For rozv'yazvannya problems iz bulovimi zmіnimi zastosovuyot kombinatornyi method, prichomu, oskilki zmіnnі - bulovi, then the method of optimizing the optimal way to ask.

Widen by widening є takozh nablizheni methods roz'yazuvannya tsilokshilivyh problems linіynogo programvannya. Oskilki for practical tasks of the great cities for the practical use of exact methods can not be known strictly optimal rozv'azok for priyonyatny hour for the rozv'yazuvannya tasks and vikorystvuyut vibrazheno viznacheni, inaccurate cobbles dani, then often in real problems to be obmezhitis vzblizheniem rozv'yazkom, pohuk yakogo Є ask.

Significant part of the approximations of algorithms are based on the vicaritative computational schemes of the exact methods, such as, for example, the method of leaking and intercourse.

Before approaching methods, lay down: the method of local optimization (the method of vector decay); Modifikatsii exact methods; The method of vipadkovyj poshuku ta іn.

The head portents for zistavlennya efektivnosti zastosuvannya specific algorithms close on the practice: so: absolute That vidno Abductions otrimanyh proximity rozv'yakiv.

, ,

De F - tsil'ova funktsіya (in the given time for the viznachensti admissibility vimogu vіdshukannya max її znachennya); X- 1 proximity of outpourings, acquaintances by an approachable method; X * - the optimal plan of problems.