Research Reports from the Department of Operations
Document Type
Report
Publication Date
4-1-1975
Abstract
The paper concerns some algorithms for solving extreme point mathematical programming problem formulated in [4]. The algorithms discussed consist in determining lower and upper bounds of the objective function and accomplishing the search for the optimal solution. The direction of search depends upon the choice of the starting point. It can be either lower or upper bound. Algorithms making use of the two possible search direction are discussed in detail. In order to illustrate the application of these algorithms, two numerical examples are solved. Some other algorithms based on different approaches are also briefly discussed.
Keywords
Operations research, Programming (Mathematics), Mathematical optimization, Algorithms, Numerical analysis--Data processing, Linear programming
Publication Title
Technical Memorandums from the Department of Operations, School of Management, Case Western Reserve University
Issue
Technical memorandum no. 355
Rights
This work is in the public domain and may be freely downloaded for personal or academic use
Recommended Citation
Kumar, S. and Wagner, D., "Some Algorithms for Solving Extreme Point Mathematical Programming Problems" (1975). Research Reports from the Department of Operations. 530.
https://commons.case.edu/wsom-ops-reports/530