Linear Programming(Computer Science ) Questions and Answers

Question 1. A graphical representation of the modular structure of a solution is a
  1.    Structure chart
  2.    Modular diagram
  3.    Top down design
  4.    Identfier table
Explanation:-
Answer: Option A. -> Structure chart
Question 2. Constraints in LP problem are called active if they
  1.    represent optimal solution
  2.    at optimality do not consume all the available resources
  3.    both a & b
  4.    none of the above
Explanation:-
Answer: Option A. -> represent optimal solution
Question 3. What is “black box” testing?
  1.    System testing
  2.    Integration testing
  3.    Testing with knowledge of the system internals
  4.    Testing without knowledge of the software internals
Explanation:-
Answer: Option D. -> Testing without knowledge of the software internals
Question 4. What is “white box” testing?
  1.    Unit testing
  2.    Integration testing
  3.    Testing with knowledge of the system internals
  4.    Testing without knowledge of the software internals
Explanation:-
Answer: Option C. -> Testing with knowledge of the system internals
Question 5. Which of the following is not a characteristic of the LP
  1.    resources must be limited
  2.    only one objective function
  3.    parameters value remains constant during the planning period
  4.    the problem must be of minimization type
Explanation:-
Answer: Option D. -> the problem must be of minimization type
Question 6. Which of the following is assumption of an LP model
  1.    divisibility
  2.    proportionality
  3.    additivity
  4.    all of the above
Explanation:-
Answer: Option D. -> all of the above
Question 7. Which of the following statements is true with respect to the optimal solution of an LP problem
  1.    Every LP problem has an optimal solution
  2.    Optimal solution of an LP problem always occurs at an extreme point
  3.    At optimal solution all resources are completely used
  4.    If an optimal solution exists, there will always be at least one at a corner
Explanation:-
Answer: Option A. -> Every LP problem has an optimal solution
Question 8. The linear function of the variables which is to be maximize or minimize is called
  1.    constraints
  2.    objective function
  3.    decision variable
  4.    none of the above
Explanation:-
Answer: Option B. -> objective function
Question 9. The value of objective function is maximum under linear constraints
  1.    at the center of feasible region
  2.    at (0,0)
  3.    at any vertex of feasible region
  4.    the vertex which is at maximum distance from (0, 0)
Explanation:-
Answer: Option C. -> at any vertex of feasible region
Question 10. A decision tree uses _________ to calculate likely outcomes
  1.    stakeholder information
  2.    facts and statistics
  3.    estimates and probabilities
  4.    shareholder data
Explanation:-
Answer: Option C. -> estimates and probabilities
© Lakshya_Education.com, All Right Reserved.
Contact Us services