A hierarchy of relaxations for nonlinear convex generalized disjunctive programming

@article{Ruiz2012AHO,
  title={A hierarchy of relaxations for nonlinear convex generalized disjunctive programming},
  author={Juan P. Ruiz and Ignacio E. Grossmann},
  journal={European Journal of Operational Research},
  year={2012},
  volume={218},
  pages={38-47}
}
We propose a framework to generate alternative mixed-integer nonlinear programming formulations for disjunctive convex programs that lead to stronger relaxations. We extend the concept of “basic steps” defined for disjunctive linear programs to the nonlinear case. A basic step is an operation that takes a disjunctive set to another with fewer number of conjuncts. We show that the strength of the relaxations increases as the number of conjuncts decreases, leading to a hierarchy of relaxations… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Thesis: Reformulations, relaxations and cutting planes for generalized disjunctive programming

  • N. Sawaya
  • Carnegie Mellon University, Pittsburgh, US.
  • 2006
Highly Influential
9 Excerpts

Modelling and computational techniques for logicbased integer programming

  • R. Raman, I. Grossmann
  • Computers and Chemical Engineering, 18:563.
  • 1994
Highly Influential
5 Excerpts

Solving pseudo-convex mixed integer optimization problems by cutting plane techniques

  • T. Westerlund, R. Poern
  • Optimization and Engineering, 3:253–280.
  • 2002
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…