this huge violation is due to ignored constraints. The output doesn’t show any error or warning.

**output is as below:**

MOSEK Version 9.1.9 (Build date: 2019-11-21 11:34:40)

Copyright © MOSEK ApS, Denmark. WWW: mosek.com

Platform: Windows/64-X86

Problem

Name :

Objective sense : min

Type : CONIC (conic optimization problem)

Constraints : 31

Cones : 2

Scalar variables : 59

Matrix variables : 0

Integer variables : 8

Optimizer started.

Mixed integer optimizer started.

Threads used: 2

Presolve started.

Presolve terminated. Time = 0.00

Presolved problem: 17 variables, 10 constraints, 24 non-zeros

Presolved problem: 0 general integer, 4 binary, 13 continuous

Clique table size: 0

BRANCHES RELAXS ACT_NDS DEPTH BEST_INT_OBJ BEST_RELAX_OBJ REL_GAP(%) TIME

0 1 1 0 NA 3.3366666759e+02 NA 0.0

0 1 1 0 3.3366667593e+02 3.3366666759e+02 2.50e-06 0.0

An optimal solution satisfying the relative gap tolerance of 1.00e-02(%) has been located.

The relative gap is 2.50e-06(%).

Objective of best integer solution : 3.336666759278e+02

Best objective bound : 3.336666675906e+02

Construct solution objective : Not employed

User objective cut value : Not employed

Number of cuts generated : 0

Number of branches : 0

Number of relaxations solved : 1

Number of interior point iterations: 14

Number of simplex iterations : 0

Time spend presolving the root : 0.00

Time spend optimizing the root : 0.05

Mixed integer optimizer terminated. Time: 0.05

Optimizer terminated. Time: 0.06

Integer solution solution summary

Problem status : PRIMAL_FEASIBLE

Solution status : INTEGER_OPTIMAL

Primal. obj: 3.3366667593e+02 nrm: 1e+03 Viol. con: 0e+00 var: 0e+00 cones: 1e-07 itg: 0e+00

Optimizer summary

Optimizer - time: 0.06

Interior-point - iterations : 0 time: 0.00

Basis identification - time: 0.00

Primal - iterations : 0 time: 0.00

Dual - iterations : 0 time: 0.00

Clean primal - iterations : 0 time: 0.00

Clean dual - iterations : 0 time: 0.00

Simplex - time: 0.00

Primal simplex - iterations : 0 time: 0.00

Dual simplex - iterations : 0 time: 0.00

Mixed integer - relaxations: 1 time: 0.05

Status: Solved

Optimal value (cvx_optval): +333.667