# Tag Info

### What is a solution?

Great question, @Dirk. People regularly stumble across this, and I believe the notion is not generally agreed upon. Here is how I use it. Main qualifiers for a solution are feasible and optimal. When ...
• 5,929
Accepted

### CPLEX non-convex Quadratic Programming algorithms

The best publicly available CPLEX global QP algorithm description I am aware of is the tutorial presentation by Ed Klotz of IBM at the March 2018 INFORMS Optimization conference. Performance Tuning ...
• 13.5k
Accepted

While iteratively approximately solving the first order Karush-Kuhn-Tucker conditions, many (nonconvex) nonlinear solvers "roll downhill", i.e., enforce descent (for minimization) of the objective ...
• 13.5k
Accepted

### Termination Criteria of Solver in Pyomo

If the IPOPT termination condition is Optimal Solution Found then the returned solution is locally optimal. IPOPT is, by design, not a global solver and therefore ...

### How to determine different gap rates?

MIP solvers such as CPLEX & Gurobi indicate a gap (in %) between the current best solution and the current best dual bound (which is a lower bound for a minimization problem). In general, the ...
• 4,183

### What is a solution?

I often encounter a clear difference in the point of view of an operator (business) and a programmer (engineering): From the business POV: if it's not feasible, it's not a solution. Given that an ...
• 4,891
Accepted

### Problem solvable $\Rightarrow$ subproblems solvable if feasible region closed, convex?

In your question, you call a problem 'solvable' if there exists an $\hat{x} \in M$ such that \begin{align}c^\top\hat{x} = \inf_{x \in \mathbb{R}^n}&\quad c^\intercal x\\\textrm{s.t.}&\quad x \...
• 6,212

### How to determine different gap rates?

Gaps are typically tied to specific models and solution methods. The gap reflects the difference between the best known bound and the objective value of the best solution produced by a particular ...
• 39.5k

### Recovering primal optimal solutions from dual sub gradient ascent using ergodic primal sequences

In general, nonlinear optimization algorithms implemented in finite precision floating point software don't converge exactly to an optimal solution exactly satisfying the optimality conditions. ...
• 13.5k
Accepted

### What methods are used to solve multi-objective optimization problem with non-linear objective functions and integer decision variables?

Disclaimer: One might want to look for a reformulation or a special structure to apply mathematical tools to find optimal in the feasible set. I am assuming you're already past the possibility that ...
• 394

### What is a solution?

Here are two more "dimensions" to the question which have not yet been addressed in any of the other answers, but can be of great significance in practice. Global optimum vs. local optimum: I will ...
• 13.5k

### What is a solution?

I mostly agree with Marco Lübbecke. I would like to add that "vectors of the right dimension" are sometimes called solution candidates. Also when we refer to an "infeasible solution" we often mean ...
• 2,856

### CPLEX non-convex Quadratic Programming algorithms

In addition to the reference of Mark, you can have a look at his technical report: Solving standard quadratic programming by cutting planes. by P. Bonami, A.Lodi, J. Schweiger, A. Tramontani Since ...
• 1,750

### CPLEX non-convex Quadratic Programming algorithms

When you call optimize without any options set, the default values will be used, and those are created by the function baronset.
• 1,702
Accepted

The notation $C^1$ means $f'$ is continuous (on $\Bbb R$ as the interval is not stated). In general $C^k(a,b]$ means that all of $f',f'',\cdots,f^{(k)}$ are continuous on $(a,b]$. You are correct ...
• 5,412

### How to determine different gap rates?

A short little note about computing gaps just appeared in 4OR: Laporte, G., Toth, P. A gap in scientific reporting. 4OR-Q J Oper Res (2021). https://doi.org/10.1007/s10288-021-00483-0
• 3,461

### multiple solutions to a nonlinear problem in GAMS

The global solver Baron can give you multiple solutions using the numsol option. For an example see: https://www.gams.com/latest/gamslib_ml/libhtml/gamslib_mhw4dxx....
• 2,806

### Number of solutions to geometric program

This is a follow-up to the post of Mark Stone. The problem can be formulated in a conic form using https://docs.mosek.com/modeling-cookbook/expo.html#geometric-programming and solves quite well on ...
• 3,206
Accepted

### Number of solutions to geometric program

I general, you can't determine infeasibility or unboundedness by the structure. But, if after change of variables to convex form, the objective is strictly convex, the solution, if it exists, is ...
• 13.5k
Accepted

### Does Dijkstra's algorithm find the optimal solution for a weighted and directed shortest paths problem?

I'm assuming the goal here is shortest (least total weight) path. As long as the "problem constraints" affect the graph only to the extent of causing arcs to exist or not exist, and as long ...
• 39.5k

### the set of optimal solutions of a linear programming (LP) problem as a mapping of right-hand side

In general, if the LP is bounded, the optimal set $M(b)$ is a face of the feasible set $P = \{ x | Ax = b, x \geq 0\}$ (which is a polyhedral set). In fact, $M$ is a function, but one that maps a ...
• 4,183

### Is Multidisciplinary Design Optimization / Collaborative Optimization used anywhere outside of the Mechanical Engineering context?

As a student I am doing research in this field, I found Wikipedia's explanation very useful. You are right, most of the applications of MDO are in the field of design for aerospace and mechanical ...
• 8,667

### CPLEX non-convex Quadratic Programming algorithms

A non-convex QP is solved to global optimality by generating the McCormick relaxation of the objective and using that relaxation in a branch-and-bound framework. For non-convex MIQPs, we also ...
• 12.2k

Only top scored, non community-wiki answers of a minimum length are eligible