This example is extracted from "Operations Research: applications and algorithms", Wayne L. The following script allows to solve the problem with the linpro function. The previous script produces the following output. The following script solves the problem with the karmarkar function. The linear program is: Maximize 6*x1 + 4*x2 + 3*x3 + 2*x4 Winstons, Section 5.2, "The Computer and Sensitivity Analysis", in the "Degeneracy and Sensitivity Analysis" subsection. The following script solves the problem with the linpro function. Or in the more general form with linear inequalities and bounds: Minimize c'*x Limitations of karmarkar before Scilab 5.3.1.
0 Comments
Leave a Reply. |