---

  Semidefinite optimization relaxations are among the widely used approaches to find global optimal or approximate solutions for many nonconvex problems. Here, we consider a specific quadratically constrained quadratic problem with an additional linear constraint. We prove that under certain conditions the semidefinite relaxation approach enables us to find a global optimal solution of the underlying problem in polynomial time .

---

We consider the extended trust region subproblem (eTRS) as the minimization of an indefinite quadratic function subject to the intersection of unit ball with a single linear inequality constraint. Using a variation of the S-Lemma, we derive the necessary and sufficient optimality conditions for eTRS. Then, an OCP/SDP formulation is introduced for the problem. Finally, several illustrative examples are provided.

---

This paper develops slacks-based measure (SBM) and additive SBM (ASBM) to evaluate efficiency of decision making units (DMUs) in a two-stage structure with undesirable outputs and feedback variables from the internal perspective. The SBM model is linearized  for a specific weight and the ASBM model is reformulated as a second order cone program. The target values for all inputs, outputs (both desirable and undesirable) and intermediate products are  provided. This study shows that unlike the SBM model, ASBM can be adapted to the preference of the decision maker by selecting the weights to aggregate stages in the network.