Lineáris optimalizálás : elmélete és belsőpontos algoritmusai

Tibor, Illés (2014) Lineáris optimalizálás : elmélete és belsőpontos algoritmusai. ELTE/BME, Budapest. (https://doi.org/10.13140/2.1.5086.4004)

[thumbnail of Tibor-Illes-ORR-2014-Linearis-optimalizalas-elmelete-es-belsopontos]
Preview
 Text. Filename: Tibor_Illes_ORR_2014_Line_ris_optimaliz_l_s_elm_lete_s_bels_pontos.pdf
Final Published Version
Download (599kB)| Preview

Abstract

Interior point methods for linear programming release the result of a long process. Today's knowledge, the first notable result was coined Frisch, who in 1955 gave a lecture at a seminar in the University of Oslo in the econometric seminar logarithmic barrier method of linear programming applicability. The method multiple algorithm called it, which was published in 1957. Another result that was almost unnoticed, Diki coined, and in 1967 was published. Diki introduced the ellipsoid named after him, which could help you to approach and approach to solve linear programming problems with a special structure. you define primal, affine scaling interior point algorithms using the method again.

CORE (COnnecting REpositories)