View in EDS

Integer programming problems with fuzzy coefficients of the right-hand side

Saved in:
Bibliographic Details
Title: Integer programming problems with fuzzy coefficients of the right-hand side
Authors: Zhargal, D., Lebedev, S. S.
Publisher Information: Russian Academy of Sciences - RAS (Rossiĭskaya Akademiya Nauk - RAN), Moscow; Nauka, Moscow
Subject Terms: \(\lambda \) -optimal solution, perturbation, Linear programming, Integer programming, quasi-polynomial algorithm, Theory of fuzzy sets, etc, integer linear programming
Description: The problem considered is to find a \(\lambda\)-optimal solution of a given integer linear programming problem, i.e., a solution which is optimal for some problem obtained from the original one via a perturbation of its right hand side (\(\lambda\) is the maximal coordinate difference). The authors give a quasi-polynomial algorithm for finding a \(\lambda\)-optimal solution of a linear 0-1 problem whose feasible set is \(\{\) x/ \(\sum_{j}\lambda_{ij}x_{ij}\leq b_ i\), \(\Sigma x_{ij}=1\}\).
Document Type: Article
File Description: application/xml
Access URL: https://zbmath.org/4085415
Accession Number: edsair.c2b0b933574d..6ef97e1decd9378b0f5c87a07983ff58
Database: OpenAIRE
Description
Abstract:The problem considered is to find a \(\lambda\)-optimal solution of a given integer linear programming problem, i.e., a solution which is optimal for some problem obtained from the original one via a perturbation of its right hand side (\(\lambda\) is the maximal coordinate difference). The authors give a quasi-polynomial algorithm for finding a \(\lambda\)-optimal solution of a linear 0-1 problem whose feasible set is \(\{\) x/ \(\sum_{j}\lambda_{ij}x_{ij}\leq b_ i\), \(\Sigma x_{ij}=1\}\).