✦ LIBER ✦

ON USING LINEAR PROGRAMMING IN DISCRIMINANT PROBLEMS

✍ Scribed by Louis W. Glorfeld; Norman Gaither

Book ID: 109166886
Publisher: Decision Sciences Institute, Georgia State University
Year: 1982
Tongue: English
Weight: 280 KB
Volume: 13
Category: Article
ISSN: 0011-7315
DOI: 10.1111/j.1540-5915.1982.tb00139.x

No coin nor oath required. For personal study only.

✦ Synopsis

ABSTRACT

This commentary evaluates the usefulness of the Freed and Glover [6] linear programming approach to the discriminant problem, relates linear programming to other parametric and nonparametric approaches, and evaluates the linear programming approach.

📜 SIMILAR VOLUMES

ON USING LINEAR PROGRAMMING IN DISCRIMIN

ON USING LINEAR PROGRAMMING IN DISCRIMINANT PROBLEMS

✍ Louis W. Glorfeld; Norman Gaither 📂 Article 📅 1982 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 280 KB

A ratio model for discriminant analysis

A ratio model for discriminant analysis using linear programming

✍ Donna L. Retzlaff-Roberts 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Separation Failure in Linear Programming

Separation Failure in Linear Programming Discriminant Models

✍ Paul A. Rubin 📂 Article 📅 1991 🏛 Decision Sciences Institute, Georgia State Univers 🌐 English ⚖ 741 KB

Solving discretized contact problems usi

Solving discretized contact problems using linear programming

✍ U. Fischer; R.J. Melosh 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 342 KB

On stability in Fuzzy Linear Programming

On stability in Fuzzy Linear Programming problems

✍ R Fullér 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Linear Programming in Some Ramsey Proble

Linear Programming in Some Ramsey Problems

✍ B.D. Mckay; S.P. Radziszowski 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 332 KB

We derive new upper bounds for the classical two-color Ramsey numbers \(R(4,5) \leqslant 27, R(5,5) \leqslant 52\), and \(R(4,6) \leqslant 43\); the previous best upper bounds known for these numbers were 28,53 , and 44 , respectively. The new bounds are obtained by solving large integer linear prog