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

Two theorems on multilevel programming problems with dominated objective functions

โœ Scribed by Shu-Shang Zhu; Shou-Yang Wang; L. Coladas

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
367 KB
Volume
14
Category
Article
ISSN
0893-9659

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

The cutting stock problem with mixed obj
The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
โœ Julien Antonio; Fabrice Chauvet; Chengbin Chu; Jean-Marie Proth ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 117 KB

The purpose of this paper is to provide ecient methods for solving a large spectrum of industrial cutting stock problems. We propose two methods. Both are based on dynamic programming. In both methods, we reduce the computation burden by keeping, at each stage of the dynamic programming process, onl

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