- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Omar Ben-Ayed, Charles E. Blair
- Operations Research
- 1990

We show, using small examples, that two algorithms previously published for the Bilevel Linear Programming problem BLP may fail to find the optimal solution and thus must be considered to be… (More)

- Charles E. Blair, Robert G. Jeroslow
- Discrete Mathematics
- 1977

Abstract We prove that the gap in optimal value, between a mixed-integer program in rationals and its corresponding linear programming relaxation, is bounded as the right-hand-side is varied. In… (More)

- Charles E. Blair, Robert G. Jeroslow, James K. Lowe
- Computers & OR
- 1986

Abstract We provide some results which relate mathematical programming techniques for treating propositional logic to theorem-proving techniques for this logic. We show that the branch-and-bound… (More)

A formulation of the network design problem as a bilevel linear program is presented which admits both the convex and concave investment functions. It also allows a more general representation of… (More)

- Omar Ben-Ayed, Charles E. Blair, David E. Boyce, Larry J. LeBlanc
- Annals OR
- 1992

The formulation of the highway network design problem (NDP) as a bilevel linear program (BLP) allows more realistic solutions taking into account the reaction of users to improvements made by the… (More)

- Charles E. Blair
- 1976

We present two rules, one of which is equivalent to linear programming, for obtaining consequence inequalities from systems of linear inequalities in which each variable is restricted to being zero… (More)

- Charles E. Blair
- Math. Program.
- 1990

We are given finitely many polyhedra defined by linear constraints, using the same constraint matrix and different right-hand sides. We consider a simple constraint system and give necessary and… (More)

- Charles E. Blair, Robert G. Jeroslow
- Discrete Mathematics
- 1979

- Charles E. Blair, Robert G. Jeroslow
- Discrete Applied Mathematics
- 1984

- Charles E. Blair
- Discrete Applied Mathematics
- 1980

Abstract A cutting-plane procedure for facial disjunctive programs is presented. At each step the point to be cut away and the disjunction used to generate the cut may be chosen freely. Some general… (More)