Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.

DOI10.1007/BF03398675zbMath1278.90367OpenAlexW2773803768MaRDI QIDQ2467856

Surabhi Sinha

Publication date: 29 January 2008

Published in: Opsearch (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• An interactive multiobjective nonlinear programming procedure
• Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
• Interactive algorithms for multiple criteria nonlinear programming problems
• Sufficient Fritz John optimality conditions and duality for nonlinear programming problems
• A characterization of quasi-concave function
• Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints
• Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions
• An augmented Lagrangian decomposition method for block diagonal linear programming problems
• An investigation of the linear three level programming problem
• Geometric Programming: Estimation of Lagrange Multipliers
• A Mathematical Programming Model of Decentralized Multi-Level Systems
• A Lagrangian Relaxation Technique for Optimizing Interconnection of Local Area Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Karush-Kuhn-Tucker transformation approach to multi-level linear programming problems.