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

Translated title of the contribution: Linear optimization: theory and interior point algorithms

Tibor Illes

Research output: Book/ReportOther report

19 Downloads (Pure)

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.
Translated title of the contributionLinear optimization: theory and interior point algorithms
Original languageOther
Number of pages95
Volume2014
DOIs
Publication statusPublished - 1 Aug 2014

Publication series

NameOperations Research Report
PublisherELTE
ISSN (Print)1215-5918

Keywords

  • linear programming
  • algorithms
  • linear optimization theory

Fingerprint Dive into the research topics of 'Linear optimization: theory and interior point algorithms'. Together they form a unique fingerprint.

Cite this