Application of general semi-infinite programming to lapidary cutting problems
From MaRDI portal
Publication:932204
DOI10.1016/j.ejor.2007.01.057zbMath1160.90581OpenAlexW2053353266WikidataQ126264536 ScholiaQ126264536MaRDI QIDQ932204
Publication date: 10 July 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1746
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Semi-infinite programming (90C34)
Related Items (17)
Some sufficient efficiency conditions in semiinfinite multiobjective fractional programming based on exponential type invexities ⋮ Saddle point criteria in nonsmooth semi-infinite minimax fractional programming problems ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ A transformation-based discretization method for solving general semi-infinite optimization problems ⋮ Higher-order parameter-free sufficient optimality conditions in discrete minmax fractional programming ⋮ How to solve a design centering problem ⋮ Extracting maximal objects from three-dimensional solid materials ⋮ Optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems on Hadamard manifolds ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions ⋮ Global optimization of generalized semi-infinite programs via restriction of the right hand side ⋮ A collision detection approach for maximizing the material utilization ⋮ How to solve a semi-infinite optimization problem ⋮ On strong KKT type sufficient optimality conditions for nonsmooth multiobjective semi-infinite mathematical programming problems with equilibrium constraints ⋮ Lower level duality and the global solution of generalized semi-infinite programs ⋮ Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints
Uses Software
Cites Work
- Unnamed Item
- Computing a global optimal solution to a design centering problem
- Cluster analysis and mathematical programming
- Bi-level strategies in semi-infinite programming.
- A modified relaxation scheme for mathematical programs with complementarity constraints
- Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- The quickhull algorithm for convex hulls
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Lower-order penalty methods for mathematical programs with complementarity constraints
This page was built for publication: Application of general semi-infinite programming to lapidary cutting problems
