I have solved a mixed integer program for my class assignment in AIMMS. Please help me in how to do sensitivity analysis and derive the computational complexity of the MIP problem. I have gone through AIMMS Modeling Guide - Sensitivity Analysis (Chapter 4). In that they mentioned only for linear programming and said there are limitations for integer programming.

Hi Thiruselvan,
Regarding the computational complexity of the MIP problem, in general MIP problems are NP hard (see also the excellent post by Jean Francois Puget about this: https://www.ibm.com/ developerworks/community/ blogs/jfp/entry/np_or_not_np_ that_is_the_question49?lang=en ). If your MIP model has some very specific properties, it might be possible that the solution to the LP relaxation of your MIP is actually an integer solution. In this case, it means you can actually solve your problem in polynomial time.
Guido Diepen
On Sunday, February 2, 2014 12:49:16 PM UTC+1, Thiruselvan S wrote:Hi all,I have solved a mixed integer program for my class assignment in AIMMS. Please help me in how to do sensitivity analysis and derive the computational complexity of the MIP problem. I have gone through AIMMS Modeling Guide - Sensitivity Analysis (Chapter 4). In that they mentioned only for linear programming and said there are limitations for integer programming.--Thanks & Regards,Thiruselvan S
--
You received this message because you are subscribed to the Google Groups "AIMMS - The Modeling System" group.
To unsubscribe from this group and stop receiving emails from it, send an email to aimms+un...@ googlegroups.com.
For more options, visit https://groups.google.com/ groups/opt_out.