The problem of locating p maximally dispersed points in a convex space is considered. This problem is formulated as a non-linear programming problem. It is shown that this problem, in a square, is ...

This is a preview. Log in through your library . Abstract The trust region approach has been extended to solving nonlinear constrained optimization. Most of these extensions consider only equality ...

Users can expect faster solves, new nonlinear capabilities, PDHG with GPU acceleration, and Kubernetes autoscaling. Gurobi Optimization, LLC, the leader in decision intelligence technology, is pleased ...

The nonlinear programming (NLP) problem with one objective function f and m constraint functions c i, which are continuously differentiable, is defined as follows: In the preceding notation, n is the ...