Setting closer targets based on non-dominated convex combinations of Pareto-efficient units: A bi-level linear programming approach in Data Envelopment Analysis

Monge, Juan F.; Ruiz, José L.

doi:10.1016/j.ejor.2023.05.034

Cited by 4 publications

(1 citation statement)

References 69 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A Bi-level Linear Programming (BLPP) is a type of multilevel programming issue [22]. Within the framework of BLPP, the decision maker situated at the higher level initially formulates a strategy [23]. The general bi-level formula can be expressed as follows: The leader has an objective function, 𝑓 1 (𝑥, 𝑦) , and the follower has an objective function of -𝑓 2 (𝑥, 𝑦).…”

Section: Literature Reviewmentioning

confidence: 99%

The Bi-Level Particle Swarm Optimization for Joint Pricing in a Supply Chain

Mansyuri,

Panudju,

Sitorus

et al. 2024

IJACSA

View full text Add to dashboard Cite

This study examines the integration of pricing and lot-sizing strategies within a system comprising only one producer and retailer. The adoption of a bi-level programming technique is justified in establishing a bi-level joint pricing model guided by the producer owing to the hierarchical nature of the supply chain. This problem maximizes manufacturer and retailer profitability by setting the wholesale quantity, lot size, and retail price simultaneously. We created a bi-level particle swarm optimization to solve bi-level programming challenges. This algorithm effectively addresses BLPPS by eliminating the need for any priori assumptions about the conditions of the problem. The bi-level particle swarm optimization algorithm demonstrated a commendable level of efficacy when applied to a set of eight benchmark bi-level issues. The proposed bi-level model was solved using the BPSO and analyzed using experimental data.

show abstract

Section: Literature Reviewmentioning

confidence: 99%