Weakly robust global optimization of max-plus linear systems with non-negative constraint sets and its application to optimizing time parameters in data transmission systems

This paper considers the weakly robust global optimization problem of max-plus linear systems with non-negative constraint sets. A characteristic of the weak robustness of global optimization is given, and the weakly robust perturbation bound is constructed to ensure that the parameter perturbations...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational and applied mathematics Vol. 473; p. 116855
Main Authors:	Yang, Weili, Tao, Yuegang, Liu, Weipeng
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2026
Subjects:	Global optimization Max-plus linear system Polynomial algorithm Relatively maximal perturbation bound Variable element Weakly robust global optimization Global optimization Weakly robust global optimization Polynomial algorithm Max-plus linear system Relatively maximal perturbation bound Variable element
ISSN:	0377-0427
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	This paper considers the weakly robust global optimization problem of max-plus linear systems with non-negative constraint sets. A characteristic of the weak robustness of global optimization is given, and the weakly robust perturbation bound is constructed to ensure that the parameter perturbations within the bound do not affect the original global minimum and one globally optimal solution. The maximal element of each row in a max-plus matrix is used to characterize the variable elements and invariable elements, and their maximum number is determined. The relatively maximal perturbation bounds are derived by using all variable and invariable elements, and a polynomial algorithm for finding these bounds is provided. The proposed weakly robust global optimization is applied to optimizing time parameters in data transmission systems. The effectiveness of the proposed method is demonstrated by examples.
ISSN:	0377-0427
DOI:	10.1016/j.cam.2025.116855