Linear mean value cross decomposition: a generalization of the Kornai-Liptak method

Article Abstract:

A modified version of cross decomposition based on an existing method is proposed for linear programming problems and does not require master problems since it involves mean values of subproblems. Results show that the mean value cross decomposition method is easy to apply while the combined primal-dual approaches are more complex. However, these are still more efficient and simpler than existing methods which use master problems.

Software, Decomposition method

---

Optimal ambushing search for a moving target

Article Abstract:

Research is presented describing the development of a non-linear programming method to help formulate a target search theory for route transition and path optimization.

Target marketing, Search theory

---

Similar abstracts:

• Abstracts: Linear production games with committee control: limiting behavior of the core. A bilevel programming approach to determine tax credits for biofuel production
• Abstracts: The next disaster: it may be impossible to prevent another catastrophe in Central Africa, but the world could at least try
• Abstracts: Executive compensation and the Modern Industrial Revolution. Executive compensation and firm performance in Italy
• Abstracts: Measuring integration: an assessment of the quality of integrated marketing communications. The organization of external communication disciplines: an integrative framework of dimensions and determinants
• Abstracts: Combinatorial optimization models for production scheduling in automated manufacturing systems. Modeling and analysis of machine sharing in manufacturing systems

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