The Karush–Kuhn–Tucker transformation approach for multi-objective multi-level linear programming problems

The Karush–Kuhn–Tucker transformation approach for multi-objective multi-level linear programming problems

0.00 Avg rating0 Votes
Article ID: iaor20032073
Country: Netherlands
Volume: 143
Issue: 1
Start Page Number: 19
End Page Number: 31
Publication Date: Nov 2002
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: linear
Abstract:

The earlier Karush–Kuhn–Tucker (KKT) transformation method has been applied to multi-level decentralized programming problems (ML(D)PPs) when the decision variable set was divided into subsets where each decision maker (DM) of the system controlled only a particular subset but had no control over any decision variables of some other subset. In this paper we give the mathematical formulation and corresponding development of ML(D)PPs by KKT transformation when DMs have absolute control over certain decision variables but some variables may be shared and hence controlled by two or more DMs.

Reviews

Required fields are marked *. Your email address will not be published.