An approximately global optimization method for assortment problems

Article Abstract:

Chen et al.'s model for assortment problems, which may be used to fit small rectangular pieces from a bigger rectangle and to locate the minimum area within the figure, are limited by two deficiencies. The first concerns the use of a polynomial term as an objective function which may not result in a comprehensive solution. The second concerns the use of excessive 0-1 variables in generating non-overlapping constraints. An improved assortment model was developed to define the approximately global optimal solution while utilizing less 0-1 variables.

Operations Research, Heuristic programming

---

Constraint proposal method for computing Pareto solutions in multi-party negotiations

Article Abstract:

Research is presented describing the development of a mathematical programming methods for use in the negotiation of multi-party Pareto solutions.

Decision-making, Decision making, Mathematical programming

---

Dynamic programming using the Fritz-John conditions

Article Abstract:

A new method is presented that uses the Fritz-John technique for action elimination in complex dynamic programming problems.

Similar abstracts:

• Abstracts: An algorithm of global optimization for solving layout problems. Fuzzy dispatching model and genetic algorithms for railyards operations
• Abstracts: A differential game approach to the dynamic mixed behavior traffic network equilibrium problem. Computation of noncooperative equilibria in ordinal games
• Abstracts: A note on the assignment problem with seniority and job priority constraints. A note on splitting of variables in integer programming models
• Abstracts: A cooperative fuzzy game theoretic approach to multiple objective design optimization. Fuzzy rule based classification with FeatureSelector and modified threshold accepting
• Abstracts: Measuring aggregate process performance using AHP. Capacity sizing in the presence of a common shared resource: dimensioning an inbound call center

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