This paper presents a fuzzy goal programming FGP procedure for solving bilevel multiobjective linear fractional programming BL-MOLFP problems. It makes an extension work of Moitra and Pal 2002 and Pal et al. 2003 . In the proposed procedure, the membership functions for the defined fuzzy goals of the decision makers DMs objective functions at both levels as well as the membership functions for ...

Abstract Bilevel optimization problems have received a lot of attention in the last years and decades. Besides numerous theoretical developments there also evolved novel solution algorithms for mixed-integer linear bilevel most recent use branch-and-cut techniques from programming that are especially tailored context. In this paper, we consider MIQP-QP problems, i.e., models with convex-quadrat...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

Interpretable Multi-Task Learning can be expressed as learning a sparse graph of the task relationship based on prediction performance learned models. Since many natural phenomenon exhibit structures, enforcing sparsity models reveals underlying relationship. Moreover, different sparsification degrees from fully connected uncover various types like cliques, trees, lines, clusters or disconnecte...

We present two bilevel programming formulations for the aircraft deconfliction problem: one based on speed regulation in k dimensions, other heading angle changes 2 dimensions. propose three reformulations of each problem KKT conditions and different duals lower-level subproblems. also a cut generation algorithm to solve formulations. Finally, we computational results variety instances.

A Mathematical Program with Linear Complementarity Constraints (MPLCC) is an optimization problem where a continuously differentiable function is minimized on a set defined by linear constraints and complementarity conditions on pairs of complementary variables. This problem finds many applications in several areas of science, engineering and economics and is also an important tool for the solu...

where x, c, c ∈ R1 , x, c, c ∈ R2 , b ∈ R, A1 is an m × n1 matrix, A2 is an m × n2 matrix, and T denotes the transposition. Such problems may arise when there are two decision makers at different hierarchical levels having joint constraints and different and possibly conflicting objectives. The decision-making process is sequential. The leader controlling the variables of x has the first choice...