The maximization of a function over the efficient set via a penalty function approach

Article Abstract:

The problem of maximizing the value of a departmental objective function a(.) over the efficient solution set E using linear functions and a polytopal set X of feasible actions is considered. Specifically, mathematical programming solutions of the problem and their penalty function versions are constructed. In addition, other features of the nonlinear problem are discussed. These include the computational complexity, epsilon efficient optima and nonlinear extensions.

Mathematical programming

---

A complementary greedy heuristic for the knapsack problem

Article Abstract:

The structural properties of Heuristic H is analyzed along with two theorems which are discussed in terms of their performance. Theorem 1 produces worst-case bound results which are better than those of Heuristic G although theorem 2 shows that H has advantages over G in some aspects. Therefore, Theorem 2 is useful in providing data on which composite heuristics are more suitable for different aspects of production.

Manufacturing industry, Manufacturing industries

---

A special class of parametric knapsack problems: analytic aids and heuristics

Article Abstract:

L. Bodin and A. Kashani's zone hopping problem dealing with the transportation of a set of items is considered. The problem has a knapsack structure which is expressed as P(alpha) where alpha is an economic parameter and w(i) are the weights of n packages. To solve it, three heuristics are evaluated with respect to their worst case performance and posterior performance.

Similar abstracts:

• Abstracts: Value of influence is on the decline in China. Court judgment against Indonesia firm may not bring any relief to creditors
• Abstracts: Simultaneous determination of the cutting speed and lot size values in machining systems. Production lot sizing in failure prone two-stage serial systems
• Abstracts: The China connection. Get with the programme: leading economist slams unilateral U.S. policy
• Abstracts: Clusters in a group: decision making in the vector space formulation of the analytic hierarchy process. Consequences of uncertainty in the analytic hierarchy process: a simulation approach
• Abstracts: A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems. Establishing the optimality of sequencing heuristics for cutting stock problems

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