An approximate approach of global optimization for polynomial programming problems

Article Abstract:

A novel approach is developed to approximate the global optimization solutions for polynomial programming problems. The approach entails the expanding the polynomial term as the sum of the bounded continuous variable, the resulting bounded continuous variable with the addition of a discrete variable and the resulting bounded continuous variable with the addition of a small variable; and linearizing the small variable based on error below a specified tolerance.

Prepackaged software, Models, Business management software, Information management software, Mathematical optimization, Optimization theory, Approximation theory, Approximation

---

Formulating the mixed integer fractional posynomial programming

Article Abstract:

Solution to a mixed integer fractional posynomial programming problem is derived using linear programming. Modified goal programming and logarithmic piecewise function (LPF) are also applied in deriving solution.

United States, Linear programming, Tests, problems and exercises, Usage, Logarithmic functions

---

An efficient linearization approach for mixed-integer problems

Article Abstract:

A new general linearization approach for mixed-integer problems is proposed.

Research, Linearization (Electronics)

Similar abstracts:

• Abstracts: An algorithm of global optimization for solving layout problems. Fuzzy dispatching model and genetic algorithms for railyards operations
• Abstracts: An approximately global optimization method for assortment problems. Dynamic programming using the Fritz-John conditions
• Abstracts: Dynamic control of multicommodity fleet management problems. A comparative evaluation of modeling approaches to the labor shift scheduling problem
• Abstracts: An exact algorithm for the knapsack sharing problem with common items. Heuristic and exact algorithms for the simultaneous assignment problem
• Abstracts: A dominant subset of V-shaped sequences for a class of single machine sequencing problems. Comparing the efficacy of ranking methods for multiple round-robin tournaments

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.