Darbe buvo sprendžiami hierarchiniai 2 etapų klasifikavimo teoriniai uždaviniai dviejų ir trijų klasių atvejais apribojant klaidingų sprendimų klasifikavimo tikimybes α_ij, i,j=1,2,..,m, arba apribojant aposteriorines klasifikavimo tikimybes β_ji, i,j=1,2,..,m. Detaliai išnagrinėti 1 etapo klasifikavimo uždavinių sprendimai, papildyta hierarchinio klasifikavimo uždavinio teorija 2 etapo klasifikavimo procedūra. 2 etape sprendžiami 4 klasifikavimo uždaviniai, kurie objektus priskirtus 1 ̅,2 ̅, 3 ̅ arba 0 klasei suklasifikuoja į 1, 2 ir 3 klases be atsisakymo priimti sprendimą, taip pat užsimenama apie 3 etapo klasifikavimo galimybę. Teorinės dalies analizuoti klasifikavimo uždaviniai, iliustruoti klasikiniais testiniais Fišerio irisų duomenimis, parodė, kad hierarchinio klasifikavimo uždavinys gali būti ekonomiškesnė alternatyva, nei klasifikavimo uždaviniai be atsisakymo priimti sprendimą. Taip pat, pavyzdyje klasifikavimo tikslumo tikimybių rezultatai buvo 2 – 3 % tikslesni negu klasifikavimo uždavinio be atsisakymo priimti sprendimą pirminių duomenų atveju. SAS programine įranga IML procedūra sukurti algoritmai, klasifikavimo taisyklių konstantoms rasti bei įvertinti klasifikavimo tikslumo tikimybes, gali būti naudojami tęstiniams šios srities moksliniams darbams. Taip pat, teorinė dalis bei programa gali būti panaudota studentams kaip papildomas mokymosi šaltinis. / In this work there was analysed theory of hierarchical two stage classification procedures of two and three class limiting wrong classification probabilities α_ij, i,j=1,2,..,m, or the posterior classification probabilities β_ji, i,j=1,2,..,m. The first stage of hierarchical classification various problems related with decision making areas was detailed examined and solved. In addition the second stage of hierarchical classification had been added and analysed, too. Theoretical analysis of the classification, which had been illustrated according to Fisher's Iris Plants Database (Fisher, 1936), was demonstrated that the hierarchical two stage classification procedure may be more economical option than the classification tasks without the rejection option. Also, the results of hierarchical two stage classification procedure were classified with 2 - 3% higher accuracy than the shared data classification tasks without the rejection option. Accomplished theoretical analysis may be useful not only to students as an additional resource for learning, but also it could be continued scientific research for various real data using SAS software IML procedure algorithm, which had been created to find the constants of classification rules and evaluate classification rules accuracies of the classification probabilities.

The essence of 3D object packing problem is to load a set of distinct boxes with given dimensions in containers to maximize volume utilization. The goal of this research is to support with algorithmic techniques the design of package layouts that meet the functional relationships between the parts and match market needs including cost, safety, comfort, as well as economic and environmental aspects. An analysis of 3D object packing algorithms, created by foreign authors, and commercial three-dimensional pallet packing software packages was performed in this work; also methods’ advantages and disadvantages were pointed out. A model of three-dimensional rectangular object packing into containers of the same shape was formed, and the software solving 3D object packing problems was created according to this model. The tests proved that the suggested method is effective and beneficial.