The hybrid algorithm for solving the three-level linear programming problem
From MaRDI portal
Publication:1102192
DOI10.1016/0305-0548(86)90023-7zbMath0643.90058MaRDI QIDQ1102192
Publication date: 1986
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(86)90023-7
convergence; goal programming; parametric analysis; hybrid algorithm; complementary pivot algorithm; Cycling; kth best extreme point; nonconvex region; three-level linear programming
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C31: Sensitivity, stability, parametric optimization
90C05: Linear programming
Related Items
On bilevel fractional programming, Two theorems on multilevel programming problems with dominated objective functions, Interactive compensatory fuzzy programming for decentralized multi-level linear programming (DMLLP) problems, An algorithm for multi-level programming problem using goal programming, A note on a linear bilevel programming algorithm based on bicriteria programming, Interactive fuzzy programming for multi-level 0-1 programming problems through genetic algorithms, Multi-level programming and conflict resolution, Efficient solutions for the linear bilevel programming problem, A modified simplex approach for solving bilevel linear programming problems, Characterizing an optimal solution to the linear bilevel programming problem, Bilevel and multilevel programming: A bibliography review, Links between linear bilevel and mixed 0-1 programming problems, Penalty function approach to linear trilevel programming, Compensatory fuzzy multiple level decision making, Interactive fuzzy programming for multilevel linear programming problems, A multi-level nonlinear multi-objective decision-making under fuzziness, A bi-level non-linear multi-objective decision making under fuzziness.
Cites Work
