arbiter
JournalsPricingAccount

BRANCH AND CUT METHOD FOR SOLVING INTEGER INDEFINITE QUADRATIC BILEVEL PROGRAMS WITH MULTIPLE OBJECTIVES AT THE UPPER LEVEL

Fatima Fali & Mustapha Moulaï

Pesquisa Operacional2025https://doi.org/10.1590/0101-7438.2025.045.00295364article
AJG 1
Weight
0.37

What the paper says

This paper proposes an exact method to solve an integer indefinite quadratic bilevel problem with multiple objectives at the upper level, where the objective functions at both levels are a product of two linear functions. The suggested algorithm uses a branch and cut algorithm based on a multiobjective integer linear problem obtained by replacing the indefinite quadratic objectives of the upper level by their two linear functions and the classical branch and bound technique for integer decision variables. Then, the integer solutions obtained are tested for optimality of the lower level problem by using a library IBM CPLEX 12.8 for C++ programs. The integer indefinite quadratic bilevel programming problem with single objective at both levels is solved in the first step, based on the dantzig cut. The second phase explorates with the efficient cut to provide the set of efficient solutions without listing the whole integer domain. After the presentation of the algorithm, a numerical example and computational experiments are provided.

1 citation

Open paper page →

Cite this paper

https://doi.org/https://doi.org/10.1590/0101-7438.2025.045.00295364

Or copy a formatted citation

@article{fatima2025,
  title        = {{BRANCH AND CUT METHOD FOR SOLVING INTEGER INDEFINITE QUADRATIC BILEVEL PROGRAMS WITH MULTIPLE OBJECTIVES AT THE UPPER LEVEL}},
  author       = {Fatima Fali & Mustapha Moulaï},
  journal      = {Pesquisa Operacional},
  year         = {2025},
  doi          = {https://doi.org/https://doi.org/10.1590/0101-7438.2025.045.00295364},
}

Paste directly into BibTeX, Zotero, or your reference manager.

Flag this paper

BRANCH AND CUT METHOD FOR SOLVING INTEGER INDEFINITE QUADRATIC BILEVEL PROGRAMS WITH MULTIPLE OBJECTIVES AT THE UPPER LEVEL

Flags are reviewed by the Arbiter methodology team within 5 business days.

Evidence weight

0.37

Balanced mode · F 0.40 / M 0.15 / V 0.05 / R 0.40

F · citation impact0.16 × 0.4 = 0.06
M · momentum0.53 × 0.15 = 0.08
V · venue signal0.50 × 0.05 = 0.03
R · text relevance †0.50 × 0.4 = 0.20

† Text relevance is estimated at 0.50 on the detail page — for your query’s actual relevance score, open this paper from a search result.