Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
From MaRDI portal
Publication:6090468
DOI10.1111/itor.12736OpenAlexW2982135222WikidataQ126975821 ScholiaQ126975821MaRDI QIDQ6090468
Pawel Jan Kalczynski, Zvi Drezner
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12736
Related Items
Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location ⋮ Review of obnoxious facilities location problems ⋮ The repeated p-dispersion problem
Cites Work
- Unnamed Item
- Unnamed Item
- Exact algorithms for the solution of the grey pattern quadratic assignment problem
- A heuristic for the circle packing problem with a variety of containers
- New approaches to circle packing in a square. With program codes.
- The obnoxious \(p\) facility network location problem with facility interaction
- Packing equal circles in a square: A deterministic global optimization approach
- The Weber obnoxious facility location model: a big arc small arc approach
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- More optimal packings of equal circles in a square
- New results in the packing of equal circles in a square
- The minimum weighted covering location problem with distance constraints
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Location of Multiple Obnoxious Facilities
- Minimum weight design of trusses using improved move limit method of sequential linear programming
- New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
- Computational efficiency of improved move limit method of sequential linear programming for structural optimization
- Comparison of iterative searches for the quadratic assignment problem
- Calculation of the move limits for the sequential linear programming method
- Solving the Continuous p-Dispersion Problem Using Non-linear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The multifacility maximin planar location problem with facility interaction
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
