✦ LIBER ✦

Inexact linear programming with generalized technological matrix sets

✍ Scribed by Jonathan F. Bard

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 390 KB
Volume: 16
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(84)90318-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Objective function bounds for the inexac

Objective function bounds for the inexact linear programming problem with generalized cost coefficients

✍ Jonathan F. Bard; Sangit Chatterjee 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 824 KB

Linear programming with fuzzy sets: A ge

Linear programming with fuzzy sets: A general approach

✍ S.T. Wierzchon 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 865 KB

Linear programming with matrix variables

✍ B.D. Craven; B. Mond 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 402 KB

Estimation of the linear programming tec

Estimation of the linear programming technological coefficient matrix by a principle of maximum efficiency

✍ Marvin D. Troutt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 417 KB

An inexact rough-interval fuzzy linear p

An inexact rough-interval fuzzy linear programming method for generating conjunctive water-allocation strategies to agricultural irrigation systems

✍ Hongwei Lu; Guohe Huang; Li He 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 714 KB

A bard-type method for a generalized lin

A bard-type method for a generalized linear complementarity problem with a nonsingular m-matrix

✍ J. J. Júdice; F. M. Pires 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 795 KB

In this article we develop an extension of Murty's Bard-type method for the solution of a generalized linear complementarity problem with upper bounds (BLCP) when its matrix M has positive principal minors ( M E P). We prove that the Bard-type algorithm converges to the unique solution of the BLCP w