✦ LIBER ✦

An approximate algorithm for the solution of the linear programming problem

✍ Scribed by V.Yu. Lebedev

Publisher: Elsevier Science
Year: 1974
Weight: 438 KB
Volume: 14
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(74)90092-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the approximate solutio

An algorithm for the approximate solution of non-linear boundary value problems

✍ V.K. Viktorov 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 298 KB

An interval programming algorithm for di

An interval programming algorithm for discrete linear L1 approximation problems

✍ P.D Robers; A Ben-Israel 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 614 KB

The problem of linear programming with a

The problem of linear programming with approximate data

✍ G.M. Agayan; A.A. Ryutin; A.N. Tikhonov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 482 KB

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting

Algorithm for discovering the set of all

Algorithm for discovering the set of all the solutions of a linear programming problem

✍ N.V. Chernikoba 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 697 KB

The complexity of approximate algorithms

The complexity of approximate algorithms for the problem of integer programming

✍ N.N. Kuzyurin 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 334 KB