A heuristic ceiling point algorithm for general integer linear programming
Article Abstract:
Feasible one-ceiling points can be used to derive optimal solutions of general linear integer programming problems, called (P). These feasible regions are characteristically bounded and nonempty. The Heuristic Ceiling Point Algorithm (HCPA) is used to illustrate an approximate solution of (P) by selectively locating feasible one-ceiling points that are relatively close to the linear programming relaxation's optimal solution. The HCPA serves as an effective computational tool for solutions of high value. Furthermore, problems that have a minimum number of general integer variables are the problems most applicable to the HCPA, although problems of the zero-one variable type can likewise be treated.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1992
User Contributions:
Comment about this article or add new information about this topic:
School Timetabling - A Case in Large Binary Integer Linear Programming
Article Abstract:
A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special ordered sets of variables. We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
School timetabling - a case in large binary integer linear programming
Article Abstract:
The timetabling problem (of interest to management science research since the 1950s) is organized as an integer linear programming problem in 0-1 variables. The solution technique is taken from the Lagrangean resolution technique and the subgradient optimization technique. The solution technique also utilizes a bound and branch approach that runs on the unique ordered sets of variables.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1984
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Combining interior-point and pivoting algorithms for linear programming. Capacity expansion of power generation systems with uncertainty in the prices of primary energy resources
- Abstracts: High tech marketing hits the target. Computer savvy at your service
- Abstracts: The role of social-desirability response bias in turnover research. Interactions among Actual Ease-of-Movement Determinants and Job Satisfaction in the Prediction of Voluntary Turnover
- Abstracts: Theorizing TQM: an Austrian and evolutionary economics interpretation. The effects of entrepreneurial personality, background and network activities on venture growth
- Abstracts: The Predictive Ability Criterion in Experimental Judgement Research in Accounting. A learning curve analysis of expert system use