✦ LIBER ✦

Solving the linear complementarity problem through concave programming

✍ Scribed by Nguyen Van Thoai; Hoang Tuy

Publisher: Elsevier Science
Year: 1983
Weight: 384 KB
Volume: 23
Category: Article
ISSN: 0041-5553
DOI: 10.1016/s0041-5553(83)80101-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate method of solving concave pr

Approximate method of solving concave programming problems

✍ B.M. Mukhamediev 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 528 KB

On some classes of matrices related to s

On some classes of matrices related to solving linear complementarity problems as linear programs

✍ Abdelaziz Foul 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Solving the multiobjective possibilistic

Solving the multiobjective possibilistic linear programming problem

✍ M. Arenas Parra; A. Bilbao Terol; M.V. Rodrı́guez Urı́a 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 136 KB

In conventional multiobjective decision making problems, the estimation of the parameters of the model is often a problematic task. Normally they are either given by the decision maker (DM), who has imprecise information and/or expresses his considerations subjectively, or by statistical inference f

Solving the problem of linear fractional

Solving the problem of linear fractional programming

✍ V. I. Klevachev 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 379 KB

Parallel pivotal algorithm for solving t

Parallel pivotal algorithm for solving the linear complementarity problem

✍ K. T. Medhi 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 547 KB

A separable programming approach to the

A separable programming approach to the linear complementarity problem

✍ Jonathan F. Bard; James E. Falk 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 519 KB