针对无上层约束的线性双层规划问题提出一种改进的K最好方法(Kth—best方法).理论和算例证明该方法在不需要原Kth—best方法的前提条件下可以有效地解决线性双层规划问题.
A modified Kth-best approach was presented for linear bilevel programming with no upper-level constraint. We proved that this modified Kth-best approach obtained via the theoretical proof and example can solve effectively linear bilevel programming with no upper-level constraint without the assumption of original Kth-best approach.