A new penalty function algorithm for convex quadratic programming
Article Abstract:
Preliminary evaluations of an exterior point, penalty function algorithm for convex quadratic programming reveals that the algorithm requires a small and almost constant number of iterations for small and medium sized problems. Iterations in the program consists of a Newton step followed by a reduction in the penalty parameter. Further studies comparing the algorithm with existing ones should be undertaken.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Effect of maintenance on the economic design of x-control chart
Article Abstract:
Issues relating to prevent maintenance are examined in detail, with a focus on the usage of x-control charts, and different maintenance levels.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
The non-central chi-square chart with two-stage samplings
Article Abstract:
The process of using a non-central chi-square chart with two-staged samplings in operations management is presented.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: A smooth penalty function algorithm for network-structured problems. A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications
- Abstracts: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts. Expected utility maximization of optimal stopping problems
- Abstracts: An exact algorithm for the knapsack sharing problem with common items. Heuristic and exact algorithms for the simultaneous assignment problem
- Abstracts: An approximate approach of global optimization for polynomial programming problems. An efficient linearization approach for mixed-integer problems
- Abstracts: Evaluation of leading heuristics for the single machine tardiness problem. A comparison of stochastic scheduling rules for maximizing project net present value