The conversion of manufacturing functional areas towards services implies a paradigm Manufacturing as Service (MaaS). It transforms the product fulfillment process to distributed one via service-oriented platform. Successful MaaS operational planning must be coordinated with low-carbon family (PFP) at front end design and development. These changes challenge traditional PFP design, considering ...

In the competitive p-median problem, two decision makers, the leader and the follower, compete to attract clients from a given market. The leader opens his facilities, anticipating that the follower will react to the decision by opening his/her own facilities. The leader and the follower try to maximize their own profits. This is the Stackelberg game. We present it as a linear bilevel 0–1 probl...

Although leader-follower games have been around for quite some time in economics and game theory, their integration into the realm of optimization and operations research is recent. In this paper, we provide an overview of research in bilevel programming that was initiated at the University of Montreal and led to a large scale application in the field of revenue management.

Computationally-aided metabolic engineering is an important, complementary strategy to combinatorial strain design for enhanced biochemical production by microbes. Bilevel optimization problems have been formulated for optimal strain design via reaction removal, activation, and inhibition. Deterministic global optimization of the resulting mixed integer linear programs (MILPs) requires extensiv...

This paper introduces interdiction branching, a new branching method for binary integer programs that is designed to overcome the difficulties encountered in solving problems for which branching on variables is inherently weak. Unlike traditional methods, selection of the disjunction in interdiction branching takes into account the best feasible solution found so far. In particular, the method ...

This paper propose a self adaptive penalty function for solving constrained value-bilevel programming problem using genetic algorithm. This self adaptive penalty function based genetic algorithm both used in the higher level and the lower level problem's solving process. In the constraint handing method, a new fitness value called distance value, in the normalized fitness-constraint violation s...

The co-operative formulation of a nonlinear bilevel program involving nonconvex functions is considered and two equivalent reformulations to simpler programs are presented. It is shown that previous literature proposals for the global solution of such programs are not generally valid for nonconvex inner programs and several consequences of nonconvexity in the inner program are identified. In pa...

Enterprise-wide supply chain planning problems inherently exhibit multi-level decision network structures, where for example, one level may correspond to a local plant control/scheduling/planning problem and another level to a plant-wide planning/distribution network problem. Such multi-level decision network structures can be mathematically represented using multi-level mathematical programmin...

Less than 100 words