On the relations between optimal solutions for different types of min-sum balanced JIT optimisation problems. (English. French summary) Zbl 07682311
Summary: The relations between optimal solutions for different types of min-sum balaneed JIT optimisation problems are examined. It is shown that the so-called min-sum-absolute and min-sum-squared problems, subject to the so-called oneness condition, have the same set of optimal solutions and that this property cannot be extended to other types of min-sum problems. It is also shown that any optimal solution for the min-sum-absolute problem with oneness property if any exists is optimal for the min-sum-squared.
MSC:
| 90-XX | Operations research, mathematical programming |
References:
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
