For some , let and be the optimal basic feasible solution of: maximize subject to , , . If the optimal value is 7, then equals _______ (in integer).
For some , let and be the optimal basic feasible solution of: maximize subject to , , . If the optimal value is 7, then equals _______ (in integer).
Answer: 3
Since and are basic, . Then the first constraint is and the objective is .
Solving these gives and . The second constraint becomes , so . The answer is .
For some β > 0, let x₁ and x₃ be the optimal basic feasible solution of: maximize x₁ + 2x₂ + 3x₃ subject to 2x₁ - x₂ + x₃ = 9, x₁ + 2x₂ - β x₃ = 1, x₁, x₂, x₃ ≥ 0. If the optimal value is 7, then β equals _ (in integer).
Also written as: For some beta > 0, let x_1 and x_3 be the optimal basic feasible solution of: maximize x_1 + 2x_2 + 3x_3 subject to 2x_1 - x_2 + x_3 = 9, x_1 + 2x_2 - beta x_3 = 1, x_1, x_2, x_3 >= 0. If the optimal value is 7, then beta equals _ (in integer).
Constrained optimisation and linear programming has come up 44 times in 7 exams since 2007.
This question is on Linear programming: formulation and graphical solution, part of Constrained optimisation and linear programming in Mathematics.
Setting up a linear program and finding its optimum at a corner of the feasible region.
TestStop has 15 past-paper questions on this subtopic; the nearest in year are below.
Question from the IIT JAM 2021 paper. Solutions are TestStop's own. Not affiliated with or endorsed by any examination authority.