Linear Programming from Fibonacci to Farkas.

At the beginning of the 13th century Fibonacci described the rules for making mixtures of all kinds, using the Hindu-Arabic system of arithmetic. His work was repeated in the early printed books of arithmetic, many of which contained chapters on 'alligation', as the subject became known. But the rul...

Descripción completa

Detalles Bibliográficos
Publicado en:Annals of Science Vol. 78; no. 1; pp. 1 - 22
Autor principal: Biggs, Norman
Formato: Artículo
Publicado: Taylor & Francis Ltd Jan2021
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=149012880&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 149012880
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00033790
        7J1
      jtl: Annals of Science
      issn: 00033790
      maglogo: Y
    pubinfo:
      dt: Jan2021
      vid: 78
      iid: 1
      pid: 377
      pub: Taylor & Francis Ltd
    artinfo:
      ui:
        149012880
        10.1080/00033790.2020.1811377
      ppf: 1
      ppct: 21
      formats:
        fmt:
          – @attributes:
              type: T
          – @attributes:
              type: P
              size: 1.4MB
      tig:
        atl: Linear Programming from Fibonacci to Farkas.
      aug:
        au: Biggs, Norman
        affil: Department of Mathematics, London School of Economics, London, UK
      su:
        Mathematical analysis
        Fibonacci, Leonardo, ca. 1170-ca. 1240
        Fourier series
        Arithmetic
        Pell, John
        Kersey, John
      sug:
        subj:
          Mathematical analysis
          Fibonacci, Leonardo, ca. 1170-ca. 1240
          Fourier series
          Arithmetic
          Pell, John
          Kersey, John
      keyword:
        Alligation
        Farkas Lemma
        indeterminacy
        inequalities
        Linear Programming
      ab: At the beginning of the 13th century Fibonacci described the rules for making mixtures of all kinds, using the Hindu-Arabic system of arithmetic. His work was repeated in the early printed books of arithmetic, many of which contained chapters on 'alligation', as the subject became known. But the rules were expressed in words, so the subject often appeared difficult, and occasionally mysterious. Some clarity began to appear when Thomas Harriot introduced a modern form of algebraic notation around 1600, and he was almost certainly the first to express the basic rule of alligation in algebraic terms. Thus a link was forged with the work on Diophantine problems that occupied mathematicians like John Pell and John Kersey in the 17th century. Joseph Fourier's work on mechanics led him to suggest a procedure for handling linear inequalities based on a combination of logic and algebra; he also introduced the idea of describing the set of feasible solutions geometrically. In 1898, inspired by Fourier's work, Gyula Farkas proved a fundamental theorem about systems of linear inequalities. This topic eventually found many applications, and it became known as Linear Programming. The theorem of Farkas also plays a significant role in Game Theory.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Copyright of Annals of Science is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use.
      item: Annals of Science
      holder: Taylor & Francis Ltd
      dt:
        @attributes:
          year: 2021
    holdings:
      @attributes:
        islocal: N