KKT transformation approach for multi-objective multi-level linear programming problems
type: Item
instance of: scholarly article
title: KKT transformation approach for multi-objective multi-level linear programming problems
zbMATH Open document ID: 1073.90552
DOI: 10.1016/S0377-2217(01)00323-X
author: Yanyan Li
published in: European Journal of Operational Research
publication date: 2002-11-13T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1827410
zbMATH Keywords: Multiple objective programming
zbMATH Keywords: Multi-level linear programming
zbMATH Keywords: Lagrange function
zbMATH Keywords: Karush-Kuhn-Tucker's optimality conditions
zbMATH Keywords: Local optimal solution
MaRDI profile type: Publication
cites work: A Mathematical Programming Model of Decentralized Multi-Level Systems
cites work: An investigation of the linear three level programming problem
cites work: Optimality conditions for the bilevel programming problem
cites work: Q3134873
cites work: Two-Level Linear Programming
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Computational Difficulties of Bilevel Linear Programming
cites work: Bilevel linear programming
cites work: The nonlinear bilevel programming problem:formulations,regularity and optimality conditions
cites work: A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
cites work: Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions
cites work: Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
cites work: An interactive multiobjective nonlinear programming procedure
cites work: A modified simplex approach for solving bilevel linear programming problems
cites work: A characterization of quasi-concave function
cites work: Geometric Programming: Estimation of Lagrange Multipliers
cites work: An augmented Lagrangian decomposition method for block diagonal linear programming problems
cites work: Interactive algorithms for multiple criteria nonlinear programming problems
cites work: Q4508040
cites work: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
cites work: Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
cites work: Q3211108
description: scientific article; zbMATH DE number 1827410