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

Note on combinatorial optimization with max-linear objective functions

โœ Scribed by Sung-Jin Chung; Horst W. Hamacher; Francesco Maffioli; Katta G. Murty

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
394 KB
Volume
42
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on programming problems with line
A note on programming problems with linear-plus-linear-fractional objective functions
โœ Joachim Hirche ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

In a recent paper Chadha presented a dual of a maximization problem for the sum of a linear and linear fractional function under linear constraints. His approach is based on assertions of Teterev which have been already proven to be erroneous. The aim of this note is to clarify deficiencies of the p

Process optimization at the design stage
Process optimization at the design stage with an objective function linear in profit and investment
โœ M.W. McEwan; G.S.G. Beveridge ๐Ÿ“‚ Article ๐Ÿ“… 1965 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 878 KB

In the optimization of chemical processes at the design stage, it is suggested that the optimization of a linear function of profit and investment allows the economics of the process to be presented in a particularly simple way. All technical considerations have been taken into account and the final

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