bilevel linear programming  is a decision making problem with a two-level decentralized organization. the textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. making a decision at one level affects that at the other one. in this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

In the last two decades there have been substantial developments in the mathematical theory of inverse optimization problems, and their applications have expanded greatly. In parallel, time series analysis and forecasting have become increasingly important in various fields of research such as data mining, economics, business, engineering, medicine, politics, and many others. Despite the large ...

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

an interactive heuristic approach can offer a practical solution to the problem of linear integer programming (lip) by combining an optimization technique with the decision maker’s (dm) judgment and technical supervision. this is made possible using the concept of bicriterion linear programming (blp) problem in an integer environment. this model proposes two bicriterion linear programs for iden...

When speaking about linear programming problems of big dimensions with rare matrix of the system, solved through simplex method, it is necessary, at each iteration, to calculate the inverse of the base matrix, which leads to the loss of the rarity character of the matrix. The paper proposes the replacement of the calculus of the inverse of the base matrix with solving through iterative parallel...

abstract it is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (cc) problem. for this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. a samp...