A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone

Article Abstract:

An interactive methodology for the resolution of a multiobjective linear decision problem is presented. It is based on the concept of the maximally changeable dominance cone, which is a negative polar cone derived from the positive outer normal vectors of all maximally efficient facets. It is also shown that a decrease in the number of efficient solutions in the objective space results from the enlargement of the dominance cone. As a result, the method reduces the set of efficient solutions sequentially, based on the assumption of constant dominance structure.

Multiple criteria decision making

---

A spreadsheet modeling approach to the Holt-Winters optimal forecasting

Article Abstract:

Using spreadsheet modelling, a study is undertaken to identify the optimal forecasting for the Holt-Winters exponential smoothing model. The approach has many benefits, such as the efficient solution to the issue of optimisation. Worked examples are included to illustrate it.

Forecasting, Spreadsheets, Spreadsheet software

---

On the numerical treatment of linearly constrained semi-infinite optimization problems

Article Abstract:

Use of algorithms to optimize various problems of linear semi-infinite programming is discussed. Additional information on mathematical models used to solve the problems of linear programming is also included.

Analysis, Mathematical models

Similar abstracts:

• Abstracts: Routing heuristics for automated pick and place machines. An interactive reference point approach for multiobjective mixed-integer programming using brand-and-bound
• Abstracts: An evolutionary approach for finding optimal trees in undirected networks. Use of location-allocation models in health service development planning in developing nations
• Abstracts: Vitkovice - an ambitious project. Vitkovice's four-high 3.5 mt rolling mill. Vitkovice in Greece
• Abstracts: A framework for decision support systems for scheduling problems. Scheduling with limited machine availability
• Abstracts: Maximizing a submodular function by integer programming: polyhedral results for the quadratic case. Conflict graphs in solving integer programming problems

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