zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
KKT transformation approach for multi-objective multi-level linear programming problems. (English) Zbl 1073.90552
Summary: 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.

90C29Multi-objective programming; goal programming
90C05Linear programming
Full Text: DOI
[1] Anandalingam, G.: A mathematical programming model of decentralized multi-level systems. Journal of operational research society 39, No. 11, 1021-1033 (1988) · Zbl 0657.90061
[2] Bard, J. F.; Falk, J. E.: An explicit solution to the multi-level programming problem. Computers and operations research 9, 77-100 (1982)
[3] Bard, J. F.: An investigation of the linear three-level programming problem. IEEE transactions on systems, man and cybernetics 14, No. 5, 711-717 (1984) · Zbl 0552.90081
[4] Bard, J. F.: Optimality conditions for the bilevel programming problem. Naval research logistics quarterly 31, 13-26 (1984) · Zbl 0537.90087
[5] Mokhtar, S. Bazaraa; Sherali, H. D.; Shetty, C. M.: Non-linear programming: theory and algorithms. (1993) · Zbl 0774.90075
[6] Bialas, W. F.; Karwan, M. H.: Two-level linear programming. Management science 30, No. 8, 1004-1020 (1984) · Zbl 0559.90053
[7] Fortuny-Amat, J.; Mccarl, B.: A representation and economic interpretation of a two-level programming problem. Journal of operational research society 32, 783-792 (1981) · Zbl 0459.90067
[8] Ben-Ayed, O.; Blair, C. E.: Computational difficulties of bilevel linear programming. Operations research 38, 556-560 (1990) · Zbl 0708.90052
[9] Ben-Ayed, O.: Bilevel linear programming. Computers and operations research 20, 485-501 (1993) · Zbl 0783.90068
[10] Candler, W.; Townsley, R.: A linear two-level programming problem. Computers and operations research 9, No. 1, 59-76 (1982)
[11] Chen, Y.; Florian, M.: The non-linear bi-level programming problem: formulations, regularity and optimality conditions. Optimization 32, No. 3, 193-209 (1995) · Zbl 0817.90101
[12] Fetterolf, P. C.; Anandalingam, G.: A Lagrangian relaxation technique for optimizing interconnection of local area networks. Operations research 40, No. 4, 678-688 (1992) · Zbl 0795.68011
[13] Komlosi, S.: Quasi-convex first-order approximations and Kuhn--Tucker type optimality conditions. European journal of operational research 65, 327-335 (1993) · Zbl 0779.49023
[14] Mangasarian, O. L.: Computable numerical bounds for Lagrange multipliers of stationary points of non-convex differentiable non-linear programs. Operations research letters 4, No. 2, 47-48 (1985) · Zbl 0565.90069
[15] M’silti, A.; Tolla, P.: An interactive multiobjective nonlinear programming procedure. European journal of operational research 64, 115-125 (1993) · Zbl 0776.90070
[16] Önal, H.: A modified simplex approach for solving bilevel linear programming problems. European journal of operational research 67, 126-135 (1993) · Zbl 0806.90086
[17] Prasad, R. V.: A characterization of quasi-concave function. Opsearch 28, No. 3, 220-221 (1991) · Zbl 0741.90066
[18] Rijckaert, M. J.; Walraven, J. C.: Geometric programming: estimation of Lagrange multipliers. Operations research 33, No. 1, 85-93 (1985) · Zbl 0585.90077
[19] Ruszczynski, A.: An augmented Lagrangian decomposition method for block diagonal linear programming problems. Operations research letters 8, 287-294 (1989)
[20] Sadagopan, S.; Ravindran, A.: Interactive algorithms for multiple criteria nonlinear programming problems. European journal of operational research 25, 247-257 (1986) · Zbl 0605.90075
[21] Sinha, S.; Biswal, M. P.: Fuzzy programming approach to bi-level linear programming problems. The journal of fuzzy mathematics 8, No. 1, 337-347 (2000) · Zbl 0962.90056
[22] Sinha, S.: A comment on anandalingam (1988): A mathematical programming model of decentralized multi-level systems. Journal of operational research society 52, 1-3 (2001)
[23] Toint, P. L.: Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints. Mathematical programming 77, 69-94 (1997) · Zbl 0891.90153
[24] Weir, T.; Mond, B.: Sufficient fritz John optimality conditions and duality for nonlinear programming problems. Opsearch 23, No. 3, 129-141 (1986) · Zbl 0611.90083
[25] Wen, U. P.; Hsu, S. T.: Linear bi-level programming problems -- a review. Journal of the operational research society 42, 125-133 (1991) · Zbl 0722.90046