Discovering the Characteristics of Mathematical Programs via Sampling

DOI10.1080/1055678021000012480zbMath1038.90074OpenAlexW1982277563MaRDI QIDQ4806377

John W. Chinneck

Publication date: 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678021000012480

zbMATH Keywords

nonlinear programcomplex model forms

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A polyhedral branch-and-cut approach to global optimization

Uses Software

• AMPL

Cites Work

• Constraint classification in mathematical programming
• A computer-assisted analysis system for mathematical programming models and solutions. A user's guide for ANALYZE. Incl. 1 disk
• Hit-and-run algorithms for the identification of nonredundant linear inequalities
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Convergence properties of hit–and–run samplers

This page was built for publication: Discovering the Characteristics of Mathematical Programs via Sampling