Linear optimization: theory and interior point algorithms

Tibor Illes

Research output: Book/ReportOther report

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
LanguageOther
Number of pages95
Volume2014
DOIs
Publication statusPublished - 1 Aug 2014

Publication series

NameOperations Research Report
PublisherELTE
ISSN (Print)1215-5918

Fingerprint

Linear programming
Scaling
Econometrics
Interior point method

Keywords

  • linear programming
  • algorithms
  • linear optimization theory

Cite this

Illes, Tibor. / Lineáris optimalizálás : elmélete és belsőpontos algoritmusai. 2014. 95 p. (Operations Research Report).
@book{82875861444c4c5faeea9179842bce96,
title = "Line{\'a}ris optimaliz{\'a}l{\'a}s: elm{\'e}lete {\'e}s belsőpontos algoritmusai",
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.",
keywords = "linear programming, algorithms, linear optimization theory",
author = "Tibor Illes",
year = "2014",
month = "8",
day = "1",
doi = "10.13140/2.1.5086.4004",
language = "Other",
volume = "2014",
series = "Operations Research Report",
publisher = "ELTE",

}

Lineáris optimalizálás : elmélete és belsőpontos algoritmusai. / Illes, Tibor.

2014. 95 p. (Operations Research Report).

Research output: Book/ReportOther report

TY - BOOK

T1 - Lineáris optimalizálás

T2 - elmélete és belsőpontos algoritmusai

AU - Illes, Tibor

PY - 2014/8/1

Y1 - 2014/8/1

N2 - 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.

AB - 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.

KW - linear programming

KW - algorithms

KW - linear optimization theory

UR - http://www.cs.elte.hu/opres/orr/

UR - http://www.cs.elte.hu/opres/orr/download/IT-LP-belsopontos-jegyzet-20140824.pdf

U2 - 10.13140/2.1.5086.4004

DO - 10.13140/2.1.5086.4004

M3 - Other report

VL - 2014

T3 - Operations Research Report

BT - Lineáris optimalizálás

ER -