On the structure and properties of a linear multilevel programming problem

DOI10.1007/BF00940342zbMath0632.90073OpenAlexW1999553023MaRDI QIDQ1095807

Harold P. Benson

Publication date: 1989

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940342

zbMATH Keywords

decision-makingmulti-stage optimizationlinear multilevel programmingmultiple plannersparametric concave minimization

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items

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, Solving a bilevel linear program when the inner decision maker control few variables, On bilevel fractional programming, Deriving the properties of linear bilevel programming via a penalty function approach, Two theorems on multilevel programming problems with dominated objective functions, A study of local solutions in linear bilevel programming, First-order necessary optimality conditions for general bilevel programming problems, Separable concave minimization via partial outer approximation and branch and bound, Test problem construction for linear bilevel programming problems, The dynamic multilevel assignment problem as a stochastic extremal process, On Stackelberg–Nash Equilibria in Bilevel Optimization Games, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, The nonlinear bilevel programming problem:formulations,regularity and optimality conditions, The nonlinear bilevel programming problem:formulations,regularity and optimality conditions, A simplex approach for finding local solutions of a linear bilevel program by equilibrium points

Cites Work

• Unnamed Item
• Geometric and algorithmic developments for a hierarchical planning problem
• Quasi-concave minimization subject to linear constraints
• Connectedness of the set of nondominated outcomes in multicriteria optimization
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
• Optimality conditions for the bilevel programming problem
• An Algorithm for Solving the General Bilevel Programming Problem
• A finite algorithm for concave minimization over a polyhedron
• The polynomial hierarchy and a simple model for competitive analysis
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• Convergent Algorithms for Minimizing a Concave Function
• On two-level optimization
• Global Maximization of a Convex Function with Linear Inequality Constraints
• Variations on a cutting plane method for solving concave minimization problems with linear constraints
• A Successive Underestimation Method for Concave Minimization Problems
• A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
• On a property of polyhedral sets
• Two-Level Linear Programming
• The Direct Power of Adjacent Vertex Programming Methods
• Convex Analysis
• Point-to-Set Maps in Mathematical Programming