The binary linear programming (BLP) model is NP-complete and up to now we have not been aware of any polynomial algorithm for this model. See for example Fortnow [1] [2] for more on complexity. In ...

The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming ...

This procedure is well established in linear programming as part of general preprocessing steps, but it is not usual in nonlinear problems (as the SDP model). The facial reduction procedure to obtain ...

A linear programming (LP) model has been developed to optimize the amount of power system peak load reduction through scheduling of control periods in commercial/industrial and residential load ...

Based on the consideration of respective and common interests of emergency management network decision-making departments and the affected people, the gray discrete bi-level programming method, is ...