✦ LIBER ✦

The problem of synthesizing fuzzy algorithms for solving problems of integral linear programming

✍ Scribed by Yu.N. Minaev

Publisher: Elsevier Science
Year: 1982
Weight: 974 KB
Volume: 22
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(82)90019-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for solving a structured cl

An algorithm for solving a structured class of linear programming problems

✍ S.Selcuk Erenguc 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 452 KB

Some algorithms for solving non-linear i

Some algorithms for solving non-linear integer mathematical programming problems

✍ Y.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 455 KB

Algorithm for solving the linear program

Algorithm for solving the linear programming problem by the loaded functional method

✍ A.P. Abramov; Yu.P. Ivanilov 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 388 KB

A new algorithm for solving the discrete

A new algorithm for solving the discrete programming problem

✍ Nguen Ngok Tyu; N.V. Chernikova 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 436 KB

The sequential linear quadratic programm

The sequential linear quadratic programming algorithm for solving dynamic optimization problems - a review.

✍ Sverre Støren; Terje Hertzberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 618 KB

A steepest edge active set algorithm for

A steepest edge active set algorithm for solving sparse linear programming problems

✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations