Reformulation-Linearization Methods for Global Optimization

@inproceedings{Sherali2007ReformulationLinearizationMF,
  title={Reformulation-Linearization Methods for Global Optimization},
  author={Hanif D. Sherali and Leo Liberti},
  year={2007}
}
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and nonlinear programming problems, as well as polyhedral outer-approximation methods for continuous… CONTINUE READING

References

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

On solving polynomial, factorable, and black-box optimization problems using the RLT methodology

  • H. D. Sherali, J. Desai
  • Essays and Surveys on Global Optimization,
  • 2005
Highly Influential
3 Excerpts

‘ Reduction constraints for the global optimization of NLPs ’

  • L. Liberti
  • International Transactions in Operations Research
  • 2004

Similar Papers

Loading similar papers…