✦ LIBER ✦

An algorithm for linearly constrained programs with a partly linear objective function

✍ Scribed by H. Greiner

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 782 KB
Volume: 16
Category: Article
ISSN: 0895-7177
DOI: 10.1016/0895-7177(92)90033-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Algorithm for Linear Programs

A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo

An analog of Karmarkar's algorithm for i

An analog of Karmarkar's algorithm for inequality constrained linear programs, with a ‘new’ class of projective transformations for centering a polytope

✍ Robert M Freund 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 491 KB

An O(n2) simplex algorithm for a class o

An O(n2) simplex algorithm for a class of linear programs with tree structure

✍ H. Schreck; G. Tinhofer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 779 KB

Symmetric duality, and a convergent subg

Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints

✍ W Oettli 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 348 KB