Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
From MaRDI portal
Recommendations
Cites work
- A branch-and-bound approach for solving a class of generalized semi-infinite programming problems
- A lifting method for generalized semi-infinite programs based on lower level Wolfe duality
- A smoothing method for mathematical programs with equilibrium constraints
- A survey on error bounds for lower semicontinuous functions
- A tree-search algorithm for mixed integer programming problems
- An algorithm for disjunctive programs
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Bi-level strategies in semi-infinite programming.
- Disjunctive optimization: Critical point theory
- Disjunctive Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves
- Error bounds in mathematical programming
- Feasible method for generalized semi-infinite programming
- Foundations of bilevel programming
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Generalized semi-infinite programming: a tutorial
- How to solve a semi-infinite optimization problem
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3598222 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- Lift-and-project for mixed 0-1 programming: recent progress
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Mixed logical-linear programming
- Nonlinear Programming
- On generalized semi-infinite optimization and bilevel optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimization. Algorithms and consistent approximations
- Practical bilevel optimization. Algorithms and applications
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Solving mixed integer nonlinear programs by outer approximation
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
Cited in
(10)- Global optimization of disjunctive programs
- Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets
- An interleaved depth-first search method for the linear optimization problem with disjunctive constraints
- Solving problems with min-type functions by disjunctive programming
- About disjunctive optimization.
- Optimization of discrete-continuous dynamic systems based on disjunctive programming
- Achieving MILP feasibility quickly using general disjunctions
- Generalized partial computation using disunification to solve constraints
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Global optimization of generalized semi-infinite programs using disjunctive programming
This page was built for publication: Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301738)
