Recent research on deterministic methods for circulating cooling water systems optimization has been well developed. However, the actual operating conditions of the system are mostly variable, so the system obtained u...Recent research on deterministic methods for circulating cooling water systems optimization has been well developed. However, the actual operating conditions of the system are mostly variable, so the system obtained under deterministic conditions may not be stable and economical. This paper studies the optimization of circulating cooling water systems under uncertain circumstance. To improve the reliability of the system and reduce the water and energy consumption, the influence of different uncertain parameters is taken into consideration. The chance constrained programming method is used to build a model under uncertain conditions, where the confidence level indicates the degree of constraint violation. Probability distribution functions are used to describe the form of uncertain parameters. The objective is to minimize the total cost and obtain the optimal cooling network configuration simultaneously.An algorithm based on Monte Carlo method is proposed, and GAMS software is used to solve the mixed integer nonlinear programming model. A case is optimized to verify the validity of the model. Compared with the deterministic optimization method, the results show that when considering the different types of uncertain parameters, a system with better economy and reliability can be obtained(total cost can be reduced at least 2%).展开更多
Solving the quadratically constrained quadratic programming(QCQP)problem is in general NP-hard.Only a few subclasses of the QCQP problem are known to be polynomial-time solvable.Recently,the QCQP problem with a noncon...Solving the quadratically constrained quadratic programming(QCQP)problem is in general NP-hard.Only a few subclasses of the QCQP problem are known to be polynomial-time solvable.Recently,the QCQP problem with a nonconvex quadratic objective function over one ball and two parallel linear constraints is proven to have an exact computable representation,which reformulates the original problem as a linear semidefinite program with additional linear and second-order cone constraints.In this paper,we provide exact computable representations for some more subclasses of the QCQP problem,in particular,the subclass with one secondorder cone constraint and two special linear constraints.展开更多
This paper develops new semidefinite programming(SDP)relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance.The first class of ...This paper develops new semidefinite programming(SDP)relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance.The first class of problems finds two minimum norm vectors in N-dimensional real or complex Euclidean space,such that M out of 2M concave quadratic constraints are satisfied.By employing a special randomized rounding procedure,we show that the ratio between the norm of the optimal solution of this model and its SDP relaxation is upper bounded by 54πM2 in the real case and by 24√Mπin the complex case.The second class of problems finds a series of minimum norm vectors subject to a set of quadratic constraints and cardinality constraints with both binary and continuous variables.We show that in this case the approximation ratio is also bounded and independent of problem dimension for both the real and the complex cases.展开更多
基金Financial support from the National Natural Science Foundation of China (22022816, 22078358)。
文摘Recent research on deterministic methods for circulating cooling water systems optimization has been well developed. However, the actual operating conditions of the system are mostly variable, so the system obtained under deterministic conditions may not be stable and economical. This paper studies the optimization of circulating cooling water systems under uncertain circumstance. To improve the reliability of the system and reduce the water and energy consumption, the influence of different uncertain parameters is taken into consideration. The chance constrained programming method is used to build a model under uncertain conditions, where the confidence level indicates the degree of constraint violation. Probability distribution functions are used to describe the form of uncertain parameters. The objective is to minimize the total cost and obtain the optimal cooling network configuration simultaneously.An algorithm based on Monte Carlo method is proposed, and GAMS software is used to solve the mixed integer nonlinear programming model. A case is optimized to verify the validity of the model. Compared with the deterministic optimization method, the results show that when considering the different types of uncertain parameters, a system with better economy and reliability can be obtained(total cost can be reduced at least 2%).
基金supported by US Army Research Office Grant(No.W911NF-04-D-0003)by the North Carolina State University Edward P.Fitts Fellowship and by National Natural Science Foundation of China(No.11171177)。
文摘Solving the quadratically constrained quadratic programming(QCQP)problem is in general NP-hard.Only a few subclasses of the QCQP problem are known to be polynomial-time solvable.Recently,the QCQP problem with a nonconvex quadratic objective function over one ball and two parallel linear constraints is proven to have an exact computable representation,which reformulates the original problem as a linear semidefinite program with additional linear and second-order cone constraints.In this paper,we provide exact computable representations for some more subclasses of the QCQP problem,in particular,the subclass with one secondorder cone constraint and two special linear constraints.
基金the National Natural Science Foundation of China(No.11101261).
文摘This paper develops new semidefinite programming(SDP)relaxation techniques for two classes of mixed binary quadratically constrained quadratic programs and analyzes their approximation performance.The first class of problems finds two minimum norm vectors in N-dimensional real or complex Euclidean space,such that M out of 2M concave quadratic constraints are satisfied.By employing a special randomized rounding procedure,we show that the ratio between the norm of the optimal solution of this model and its SDP relaxation is upper bounded by 54πM2 in the real case and by 24√Mπin the complex case.The second class of problems finds a series of minimum norm vectors subject to a set of quadratic constraints and cardinality constraints with both binary and continuous variables.We show that in this case the approximation ratio is also bounded and independent of problem dimension for both the real and the complex cases.