betaFeedback

WorksMathematics

A Feasible-Domain Reduction Approach with Objective-Loss Guarantees for Multilevel Multiobjective Linear Programming

Abstract

In some approaches to decentralized multilevel multiobjective programming, each decision-maker selects a compromise and restricts the feasible region before passing the decision to the next level. However, these restrictions do not necessarily limit the deterioration of objective values at preceding levels. This paper studies how to choose variable bounds that keep such losses within prescribed tolerances. We establish exact conditions using linear programming duality and derive simpler bounds based on objective coefficients. We also examine the choice of restriction widths and establish guarantees for successive reductions. A two-level numerical example illustrates the results and the influence of tolerances on the final compromise.

Paper details

vlnc:W_a2ydh7md
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

AI-assisted tools

View statement
Looking for related papers…