would complexity of constraint satisfaction problem bound the constrained optimization problem?
No, no optimization problem can be $\mathsf{NP}$-complete since all $\mathsf{NP}$-complete problems are in $\mathsf{NP}$ and $\mathsf{NP}$ only contains decision problems.