𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Inequality Sorting Algorithm for a Class of Linear Programming Problems

✍ Scribed by V. Lakshmikantham; S.K. Sen

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
282 KB
Volume
174
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

FURTHER DEVELOPMENT OF AN ALTERNATIVE AL
FURTHER DEVELOPMENT OF AN ALTERNATIVE ALGORITHM FOR A CLASS OF H∞ DESIGN PROBLEMS
✍ T. C. YANG πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 316 KB πŸ‘ 2 views

This article presents a tutorial exposition of an algorithm suggested by Kwakernaak which is an alternative to the standard state space solution for a class of H optimization problems. In addition, a set of formulae for the computation required is derived. From these formulae one can simply use an o

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