document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1178458>Question 1178458</A>: <I><SPAN STYLE=\"word-break: break-all;\"> 1. In a LPP, if the primal has 3 variables, then the dual too will always have 3 variables. \r<BR>\n" );
document.write( "\n" );
document.write( "Select one:<BR>\n" );
document.write( "True<BR>\n" );
document.write( "False\r<BR>\n" );
document.write( "\n" );
document.write( "2. In the standard form of a linear programming problem, the objective function can be both maximisation or minimisation type. \r<BR>\n" );
document.write( "\n" );
document.write( "Select one:<BR>\n" );
document.write( "True<BR>\n" );
document.write( "False </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #850342 by </B><A HREF=/tutors/aboutme.mpl?userid=CPhill><B>CPhill(1959)</B></A><img src=\"/images/stars/stars-12.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=CPhill><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=CPhill><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=850342\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Let's analyze each statement:\r<BR>\n" );
document.write( "\n" );
document.write( "**1. In a LPP, if the primal has 3 variables, then the dual too will always have 3 variables.**\r<BR>\n" );
document.write( "\n" );
document.write( "* **False:** The number of variables in the primal problem corresponds to the number of constraints in the dual problem, and the number of constraints in the primal problem corresponds to the number of variables in the dual problem. Therefore, if the primal problem has 3 variables, the dual problem will have 3 constraints. The number of variables in the dual is equal to the number of constraints in the primal.\r<BR>\n" );
document.write( "\n" );
document.write( "**2. In the standard form of a linear programming problem, the objective function can be both maximisation or minimisation type.**\r<BR>\n" );
document.write( "\n" );
document.write( "* **False:** The standard form of a linear programming problem typically requires the objective function to be of the maximization type. Minimization problems are converted to maximization problems by multiplying the objective function by -1.<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );