首页> 外文期刊>journal of physics: conference series >Global optimal solution on blending problem
【24h】

Global optimal solution on blending problem

机译:混合问题的全局最优解

获取原文

摘要

In order to study the algorithm of the global optimal solution of the blending problem. The general optimization model for blending problems is given in this paper, at the same time, the blending problem was transformed into the concave minimization problem and linear programming problem, the relevant proof was also given. Research shows that the blending problem is formulated as a concave minimization problem and linear programming problem, can reduce the number of variables blending problem. Blending problem is transformed into a linear programming enable blending problem solving becomes simple and easy.
机译:为了研究混合问题的全局最优解算法。本文给出了混合问题的一般优化模型,同时将混合问题转化为凹最小化问题和线性规划问题,并给出了相关证明。研究表明,混合问题被表述为凹最小化问题和线性规划问题,可以减少混合问题的变量数量。将混合问题转化为线性规划,使混合问题的解决变得简单易行。

著录项

  • 来源
  • 作者

    Yingchun Zheng;

  • 作者单位

    School of Science, Xi’an University of Science and Technology, Xi’an 710054, China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号