期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Studies of benzyl hydroxamic acid/calcium lignosulphonate addition order in the flotation separation of smithsonite from calcite 被引量:5
1
作者 Cheng Liu Yuhua Zhu +2 位作者 Kaihua Huang Siyuan Yang zhian liang 《International Journal of Mining Science and Technology》 SCIE EI CAS CSCD 2021年第6期1153-1158,共6页
Flotation separation of smithsonite from calcite is difficult due to their similar surface properties.In the present study,a reagent scheme of depressant calcium lignosulphonate(CLS) and collector benzyl hydroxamic ac... Flotation separation of smithsonite from calcite is difficult due to their similar surface properties.In the present study,a reagent scheme of depressant calcium lignosulphonate(CLS) and collector benzyl hydroxamic acid(BHA) was introduced in the flotation of smithsonite from calcite.Microflotation tests revealed that the efficient flotation of smithsonite from calcite could only be obtained with the addition order of BHA before CLS,which was opposite to the widely-used order that adding depressant prior to the collector.The zeta potential measurements indicated that BHA selectively adsorbed onto smithsonite surface,then not allowed the CLS adsorption onto the smithsonite surface rather than calcite surface because of the steric hindrance,thereby the smithsonite surface remained hydrophobic while calcite surface became more hydrophilic after the addition of CLS.As a result,the calcite flotation was completely depressed while the smithsonite flotation recovery was still in high value,leading to the optimal flotation separation performance. 展开更多
关键词 SMITHSONITE CALCITE Benzyl hydroxamic acid Calcium lignosulphonate Flotation separation
下载PDF
A General Class of Convexification Transformation for the Noninferior Frontier of a Multiobjective Program
2
作者 Tao Li Yanjun Wang zhian liang 《American Journal of Operations Research》 2013年第3期387-392,共6页
A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified c... A general class of convexification transformations is proposed to convexify the noninferior frontier of a multiobjective program. We prove that under certain assumptions the noninferior frontier could be convexified completely or partly after transformation and then weighting method can be applied to identify the noninferior solutions. Numerical experiments are given to vindicate our results. 展开更多
关键词 Noninferior FRONTIER CONVEXIFICATION Weighting Method MULTIOBJECTIVE Optimization
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部