✦ LIBER ✦

A decomposition procedure for one class of block programming problems

✍ Scribed by A.P. Tizik; V.I. Tsurkov

Publisher: Elsevier Science
Year: 1989
Weight: 449 KB
Volume: 29
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(89)90204-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A network decomposition/aggregation proc

A network decomposition/aggregation procedure for a class of multicommodity transportation problems

✍ James R. Evans 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB

A method of solving one class of integer

A method of solving one class of integer programming problems

✍ V.G. Anisimov; E.G. Anisimov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 332 KB

A decomposition method of solving block

A decomposition method of solving block problems of linear programming with connecting variables

✍ V.Yu. Lebedev 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 301 KB

On one class of iterational methods for

On one class of iterational methods for solving problems of convex programming

✍ V.G. Zhadan 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 856 KB

Duality for a Class of Nondifferentiable

Duality for a Class of Nondifferentiable Multiobjective Programming Problems

✍ Xin Min Yang; Kok Lay Teo; Xiao Qi Yang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 64 KB

In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established

Duality for a class of nondifferentiable

Duality for a class of nondifferentiable mathematical programming problems

✍ Shinji Tanimoto 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 348 KB