Mathematical Optimization

← Back to Domain-Specific Abstractions by Domain

4 domain-specific abstractions whose origin domain is Mathematical Optimization.

• Bilinear program — A nonlinear optimization problem whose objective or constraints contain products that are linear in either variable block when the other is fixed.
• Complementarity theory — The theory of optimization and equilibrium problems seeking nonnegative vectors whose paired components have zero product, so each constraint and associated slack cannot both be positive.
• Generalized Semi-Infinite Programming — Optimize finitely many decision variables subject to infinitely many parameterized constraints whose index set itself depends on the decision, coupling outer feasibility to a moving lower-level feasible set.
• Relaxation (approximation) — The replacement of a difficult optimization problem by an easier problem with weakened constraints or simplified structure whose solution bounds or informs the original.