Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Linear goal programming in estimation of classification probability

Article Abstract:

Linear programming applications to group membership probabilities do not provide for within group discrimination capability that hinders the use in statistical discriminant analysis. A continuous goal programming (GP) model using conditional properties of group membership has been developed that provides for this feature. The GP uses order preservation of membership probability pairs in the development sample and has been shown to be effective.

Author: Choo, E.U., Lam, K.F., Wedley, W.C.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


New LP based heuristics for the classification problem

Article Abstract:

Three linear programming heuristic procedures for use in two group classification problem applications are evaluated. The procedures utilize expected total cost of misclassification minimization and are shown to be more computationally efficient than existing methodologies. In addition, two of the techniques, single seed and three seed heuristics, provide almost optimal solutions over a range of experimental conditions.

Author: Abad, P.L., Banks, W.J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
Heuristic programming

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A modified simplex approach for solving bilevel linear programming problems

Article Abstract:

A technique for simultaneously solving linear programming problems of two levels is presented. The method simplifies the problem by replacing the inner level with its necessary and sufficient Kunh-Tucker form. The complementary slackness equations are then considered penalty funtions of the outer level and the resulting quadratic programme can be solved by iterative use of a modified simplex algorithm.

Author: Onal, Hayri
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
Usage, Simplex method, Simplexes (Mathematics)

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Methods, Multiple criteria decision making, Linear programming, Discriminant analysis
Similar abstracts:
  • Abstracts: Least absolute deviation estimation of stationary time series models. Multicriteria optimization of a single-cell oil production
  • Abstracts: A heuristic for finding embedded network structure in mathematical programmes. The concave cost supply problem
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.