Abstract
In most applications of generalized mixed integer linear programs in the frame of the Complex Method [i], [2] there are regarded only bounds for the variable coefficients. The case of column-wise linear constraints for variable coefficients is solved in [3]. The discrete optimization with bilinear objective function and linear contraints leads to a special case of row-wise linear contralhts for variable coefficients. The following generalized mixed integer linear program (P) will be discussed:
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.
