نتایج جستجو برای: bilevel linear programming
تعداد نتایج: 770220 فیلتر نتایج به سال:
Train Set Organization (TSO) is to arrange the train set in railway freight transportation. Bilevel programming techniques were proposed to solve the Stackelberg game in which play is sequential and cooperation is not permitted. In this paper, an optimizing model for TSO is developed by the bilevel techniques. First, we analyzed the multiple level nature of management on TSO and simplified it i...
We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global...
A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling paradigm for a broad collection of problems, including bilevel programs, Stackelberg games, inverse quadratic programs, and problems involving equilibrium...
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These appro...
In this paper, we investigate the pessimistic bilevel linear optimization problem (PBLOP). Based on the lower level optimal value function and duality, the PBLOP can be transformed to a single-level while nonconvex and nonsmooth optimization problem. By use of linear optimization duality, we obtain a tractable and equivalent transformation and propose algorithms for computing global or local op...
The quadratic bilevel programming problem is an instance of a quadratic hierarchical decision process where the lower level constraint set is dependent on decisions taken at the upper level. By replacing the inner problem by its corresponding KKT optimality conditions, the problem is transformed to a single yet non-convex quadratic program, due to the complementarity condition. In this paper we...
the fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. a linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. in contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید