๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A variable transformation method for solving linear absolute-value objective-function problems with linear constraints

โœ Scribed by Lin Chao Lu; Yan Wang

Book ID
107987837
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
144 KB
Volume
21
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Variations on a cutting plane method for
Variations on a cutting plane method for solving concave minimization problems with linear constraints
โœ A. Victor Cabot ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th

Two new algorithms for solving optimizat
Two new algorithms for solving optimization problems with one linear objective function and finitely many constraints of fuzzy relation inequalities
โœ Ali Abbasi Molai ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 877 KB

This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio