Abstract
In this paper, we deal with several classes of max-min programming problems. The first class refers to some max-min bicriterion fractional programming problems with separate polyhedral constraints. We show that these problems can be transformed into bicriterion fractional maximization problems. The second class involves some polynomial max-min problems with separate polyhedral constraints. The third class comprises some max-min problems with joint linear constraints.
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 callDisclaimer: 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.
