Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 328

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Linear and Nonlinear Separation of Patterns by Linear Programming

Mangasarian, O. L.·1965·Operations Research

Abstract

A pattern separation problem is basically a problem of obtaining a criterion for distinguishing between the elements of two disjoint sets of patterns. The patterns are usually represented by points in a Euclidean space. One way to achieve separation is to construct a plane or a nonlinear surface such that one set of patterns lies on one side of the plane or the surface, and the other set of patterns on the other side. Recently, it has been shown that linear and ellipsoidal separation may be achieved by nonlinear programming. In this work it is shown that both linear and nonlinear separation may be achieved by linear programming.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1287/opre.13.3.444

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 328

Metadata

Authors
Mangasarian, O. L.
Venue
Operations Research
Published
1965-06
Volume
13
Issue
3
Pages
444-452
ISSN
  • 0030-364X (ISSN-L)
  • 1526-5463
OpenAlex
W2060591526
Cited by
328
References
1
FWCI
1.79
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Linear and Nonlinear Separation of Patterns by Linear Programming. https://app.cochat.ai/papers/10.1287/opre.13.3.444
The paper
Mangasarian, O. L. (1965). Linear and Nonlinear Separation of Patterns by Linear Programming. Operations Research. https://doi.org/10.1287/opre.13.3.444

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.