A kvadratikus szimplex algoritmus végessége indexválasztási szabályok alkalmazása esetén

Translated title of the contribution: When using the simplex algorithm quadratic finite index electoral rules

Tibor Illes, Nagy Adrienn

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper we will also prove the quadratic finite primal simplex method, the conditional linear, convex quadratic optimization problems, cyclization index against the application of electoral rules. The original quadratic primal simplex method Wolfe and van de Pannees Whinston developed, and a number of articles published during the 1960s.
Translated title of the contributionWhen using the simplex algorithm quadratic finite index electoral rules
Original languageOther
Pages (from-to)1-21
Number of pages21
JournalAlkalmazott Matematikai Lapok
Volume30
Publication statusPublished - 13 Apr 2014

Keywords

  • optimisation techniques
  • primal simplex method
  • electoral rules

Fingerprint

Dive into the research topics of 'When using the simplex algorithm quadratic finite index electoral rules'. Together they form a unique fingerprint.

Cite this