Abstract
SYNOPTIC ABSTRACTDiscriminant analysis is an important approach used to solve many practical problems in various fields. A number of mathematical programming models have been developed for this analysis. While some drawbacks with linear programming models have been discussed, little has been done on nonlinear programming (NLP) models due to their complexity. This paper examines the significance of multiple and unacceptable solutions in NLP discriminant analysis, identifies the conditions under which these solutions are generated, and proposes a regularization method to eliminate multiple solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: American Journal of Mathematical and Management Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
