First step immersion in interval linear programming with linear dependencies
Authors
Abstract:
We consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. Contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. We present a class of problems that are easily solved by reduction to the classical case. In contrast, we also show a class of problems with very simple dependencies, which appear to be hard to deal with. We also point out some interesting open problems.
similar resources
first step immersion in interval linear programming with linear dependencies
we consider a linear programming problem in a general form and suppose that all coefficients may vary in some prescribed intervals. contrary to classical models, where parameters can attain any value from the interval domains independently, we study problems with linear dependencies between the parameters. we present a class of problems that are easily solved by reduction to the classi...
full textInterval Linear Programming with generalized interval arithmetic
Generally, vagueness is modelled by a fuzzy approach and randomness by a stochastic approach. But in some cases, a decision maker may prefer using interval numbers as coefficients of an inexact relationship. In this paper, we define a linear programming problem involving interval numbers as an extension of the classical linear programming problem to an inexact environment. By using a new simple...
full textViolation analysis on two-step method for interval linear programming
In many real world problems, system parameters or model coefficients may be bounded between lower and upper bounds due to a variety of uncertainties. Over the past decades, intensive research efforts have focused on interval linear programming (ILP) to tackle such uncertainties. As one of the most popular methods for solving ILP problems, Two-Step Method (TSM, proposed by Huang et al. in 1995) ...
full textSOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED
Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...
full textInverse linear programming with interval coefficients
The paper deals with the inverse linear programming problem over intervals. More precisely, given interval domains for the objective function coefficients and constraint coefficients of a linear program, we ask for which scenario a prescribed optimal value is attained. Using continuity of the optimal value function (under some assumptions), we propose a method based on parametric linear program...
full textLinear programming with interval right hand sides
In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...
full textMy Resources
Journal title
volume 42 issue Issue 7 (Special Issue)
pages 43- 53
publication date 2016-12-18
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023