Discovering the Characteristics of Mathematical Programs via Sampling

DOI10.1080/1055678021000012480MaRDI QIDQ4806377zbMATH OpenOpenAlexFDO

Authors John W. Chinneck

Publication date 2002

Published in Optimization Methods \& 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)

Recommendations

• The empirical behavior of sampling methods for stochastic programming
• An application of mathematical programming to sample allocation
• scientific article; zbMATH DE number 3860894
• Sampling algebraic varieties for sum of squares programs
• Analyzing mathematical programs using MProbe
• Sampling and probe methods -- an algorithmical view
• Practically uniform solution sampling in constraint programming
• Sampling automata and programs
• A sequential sampling procedure for stochastic programming

Cites work

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

Cited in

(1)

• A polyhedral branch-and-cut approach to global optimization

Describes a project that uses

Uses Software

• AMPL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806377)