zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
A probabilistic bi-level linear multi-objective programming problem to supply chain planning. (English) Zbl 1137.90659

Summary: Bi-level programming, a tool for modeling decentralized decisions, consists of the objective(s) of the leader at its first level and that is of the follower at the second level. Three level programming results when second level is itself a bi-level programming. By extending this idea it is possible to define multi-level programs with any number of levels.

In most of the real life problems in mathematical programming, the parameters are considered as random variables. The branch of mathematical programming which deals with the theory and methods for the solution of conditional extremum problems under incomplete information about the random parameters is called “stochastic programming”.

Supply chain planning problems are concerned with synchronizing and optimizing multiple activities involved in the enterprise, from the start of the process, such as procurement of the raw materials, through a series of process operations, to the end, such as distribution of the final product to customers.

Enterprise-wide supply chain planning problems naturally exhibit a multi-level decision network structure, where for example, one level may correspond to a local plant control/scheduling/planning problem and another level to a corresponding plant-wide planning/network problem. Such a multi-level decision network structure can be mathematically represented by using “multi-level programming” principles.

In this paper, we consider a “probabilistic bi-level linear multi-objective programming problem” and its application in enterprise-wide supply chain planning problem where (1) market demand, (2) production capacity of each plant and (3) resource available to all plants for each product are random variables and the constraints may consist of joint probability distributions or not. This probabilistic model is first converted into an equivalent deterministic model in each level, to which fuzzy programming technique is applied to solve the multi-objective nonlinear programming problem to obtain a compromise solution.

MSC:
90C29Multi-objective programming; goal programming
90B50Management decision making, including multiple objectives