MCQ Questions
Q.1.
In linear​ programming, choices available to a decision maker are called
  • 0%
    decision variables
  • 0%
    .decision variables
  • 0%
    postoptimality analysis
  • 0%
    infeasible solution
Q.2.
What is a mathematical expression in linear programming that maximizes or minimizes some​ quantity?
  • 0%
    infeasible solution
  • 0%
    simplex method
  • 0%
    decision variables
  • 0%
    objective function
Q.3.
An optimal solution to a linear programming problem MUST lie
  • 0%
    the number of units of each product produced
  • 0%
    How much money should we invest in this​ project?
  • 0%
    an​ objective, constraints,​ alternatives, and linearity
  • 0%
    at the intersection of at least two constraints
Q.4.
If A​, B​, and C are​ variables, which of the following functions is NOT​ linear?
  • 0%
    maximize profit
  • 0%
    the number of units of each product produced
  • 0%
    shadow price
  • 0%
    ABC
Q.5.
Linear programming is a mathematical technique designed to help operations managers plan and make decisions necessary to allocate
  • 0%
    corner points
  • 0%
    ​​iso-cost
  • 0%
    constraints
  • 0%
    resources
Q.6.
The​ product-mix, diet, and labor scheduling LP formulations typically have​ ________, ________, and​ ________ objectives, respectively.
  • 0%
    the number of units of each product produced
  • 0%
    maximization, minimization, minimization
  • 0%
    diet problem
  • 0%
    How much money should we invest in this​ project?
Q.7.
Which of the following is NOT considered to be a resource for a​ firm?
  • 0%
    binary variables
  • 0%
    corner-point method
  • 0%
    accounts payable
  • 0%
    shadow price
Q.8.
The graphical solution to a linear programming problem can only be used when there are two
  • 0%
    binary variables
  • 0%
    decision variables
  • 0%
    maximize profit
  • 0%
    .decision variables
Q.9.
In linear​ programming, what are restrictions that limit the degree to which a manager can pursue an​ objective?
  • 0%
    infeasible solution
  • 0%
    postoptimality analysis
  • 0%
    corner points
  • 0%
    constraints
Q.10.
In a typical​ product-mix problem in linear​ programming, each general constraint states that
  • 0%
    the amount of a resource used less than or equals the amount of resource available.
  • 0%
    the number of units of each product produced
  • 0%
    maximize profit
  • 0%
    at the intersection of at least two constraints
Q.11.
What are the four requirements of a linear programming​ problem?
  • 0%
    How much money should we invest in this​ project?
  • 0%
    at the intersection of at least two constraints
  • 0%
    an​ objective, constraints,​ alternatives, and linearity
  • 0%
    shadow price
Q.12.
In a typical​ product-mix problem in linear​ programming, the variables are defined as
  • 0%
    the amount of a resource used less than or equals the amount of resource available.
  • 0%
    at the intersection of at least two constraints
  • 0%
    maximize profit
  • 0%
    the number of units of each product produced
Q.13.
What is the name of the algorithm that solves linear programming problems of all​ sizes?
  • 0%
    accounts payable
  • 0%
    shadow price
  • 0%
    objective function
  • 0%
    simplex method
Q.14.
Two or more products are produced using limited resources. The firm would like to determine how many units of each product it should produce to maximize overall profit given its limited resources.This situation describes what type of problem in linear​ programming?
  • 0%
    product-mix
  • 0%
    ​​iso-cost
  • 0%
    shadow price
  • 0%
    constraints
Q.15.
What is the value of one additional unit of a scarce resource in​ LP?
  • 0%
    accounts payable
  • 0%
    shadow price
  • 0%
    binary variables
  • 0%
    simplex method
Q.16.
In linear​ programming, what is another name for sensitivity​ analysis?
  • 0%
    postoptimality analysis
  • 0%
    constraints
  • 0%
    .decision variables
  • 0%
    infeasible solution
Q.17.
Decision variables that can only take on the value of 0 or 1 are called
  • 0%
    shadow price
  • 0%
    decision variables
  • 0%
    accounts payable
  • 0%
    binary variables
Q.18.
In linear​ programming, a solution that does not simultaneously satisfy all constraints is called an
  • 0%
    .decision variables
  • 0%
    infeasible solution
  • 0%
    postoptimality analysis
  • 0%
    constraints