An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem

Article Abstract:

A heuristic solution algorithm generating optimal or near optimal solutions is developed for solving a class of integer linear programming (ILP) problems. The algorithm is described as an objective hyperplane search and is developed by formulating and incorporating knapsack problem formulation. The knapsack problem is formulated over the solution space using composites of the ILP objective function and constraints.

Operations Research, Reports, Integer programming, Optimization theory, Mathematical programming

---

Model accreditation: a rationale and process for determining a numerical rating

Article Abstract:

A numerically-based systematic method for determining the accreditation rating of operational research models forces the participants of the decision-making activity to establish a clear model evaluation structure. In turn, the structure would allow for consistency and focus concerning the use of the model. The technique was developed for use in consonance with the analytic hierarchy process methodology.

Research, Decision-making, Decision making, Models and modelmaking, Models (Toys)

---

The compromise hypersphere for multiobjective linear programming

Article Abstract:

Utilization of a hypersphere for solving linear programming problems pertaining to ranking of full set or subset of efficient extreme point solutions is discussed.

United States, Linear programming, Usage, Set theory, Fuzzy sets

Similar abstracts:

• Abstracts: A note on efficient solutions for the linear bilevel programming problem. Investment and harvest strategies of the Finnish forest sector under different forest-tax policies: a differential game approach with computer-based decision aid
• Abstracts: Computational performance and efficiency of lower-bound procedures for the dynamic facility layout problem. Inventory models with inventory-level-dependent demand: a comprehensive review and unifying theory
• Abstracts: Implied constraints and LP duals of general nonlinear programming problems. Optimal partitions for shop floor control in semiconductor wafer fabrication
• Abstracts: More players, less profit. Worth the trek: Japan's interest in southern Africa grows
• Abstracts: Restricted neighborhood in the tabu search for the flowshop problem. An SA/TS mixture algorithm for the scheduling tardiness problem

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