Scholarlink

In the previous chapters we have discussed the necessary and sufficient conditions for linear and non-linear programming problems to have an optimal solution. In general, however, the problem of finding this optimal solution is extremely difficult if not impossible. For this reason, it becomes necessary to develop rigorous mathematical procedures that enable us to approximate the optimal solution.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Algorithms and Their Convergence

  • 章节

  • 发表日期：

    2026年

查看全文
  • Andrea Carpignani,
  • Massimo Pappalardo

摘要

In the previous chapters we have discussed the necessary and sufficient conditions for linear and non-linear programming problems to have an optimal solution. In general, however, the problem of finding this optimal solution is extremely difficult if not impossible. For this reason, it becomes necessary to develop rigorous mathematical procedures that enable us to approximate the optimal solution.