Test
Final Review 2
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (13)
1To perform sensitivity analysis involving an integer linear program, it is recommended to
- Ause the dual prices very cautiously
- Bmake multiple computer runs
- Cuse the same approach as you would for a linear program
- Duse LP relaxation
2Modeling a fixed cost problem as an integer linear program requires
- Aadding the fixed cost problem as an integer linear program requires
- Busing 0-1 variables
- Cusing multiple choice constraints
- Dusing LP relaxation
3The objective of the maximal flow solution approach is to
- Amaximize resource allocation
- Bmaximize the total amount of flow from an origin to a destination
- Cdetermine the longest distance between an originating point and one or more destination points
- Ddetermine the shortest distance between an originating point and one or more destination points
4The shortest route problem requires
- Aeach destination to be visited only once
- Bfinding the quickest route from the source to the destination node
- Cthat there be a branch from each destination to every other destination
- Dthat there be no two-way branches between nodes
5The maximal flow algorithm
- Adoes not require flow on every branch for the final solution
- Bmay end with capacity remaining at the source
- Cmay end with capacity at those nodes leading immediately to the destination
- Dall of the above
6Which constraint best describes the situation with decision variables A and B?
- AB - A < 0
- BB - A = 0
- CB + A = 1
- DB + A <= 1
- Enone of the above
7Which of the constraints best describes the relationship between the iPads for everyone and the Speaker series
- AA - C < 1
- BA + C = 1
- CA - C = 0
- DA + C = 2
8Which of the following constraint best describes the relationship between the electronic wall street journal subscription and the ipads: E - A = 1
- AVerdadero
- BFalso
9In a balanced transportation model where supply equals demand
- Aall constraints are equalities
- Bnone of the constraints are equalities
- Call constraints are inequalities
- Dnone of the above
10in the linear programming formulation of a transportation network
- Athere is one variable for each arc
- Bthere is one constraint for each node
- Cthe sum of variables corresponding to arcs out of a source node is constrained by the supply at that node
- Dall of the above
11The assignment problem constrains x41 +x42 + x43 + x44 < 3 means
- Aagent 3 can be assigned to 4 tasks
- Bagent 4 can be assigned to 3 tasks
- Ca mixture of agents 1,2,3 and 4 will be assigned to tasks 1, 2 , or 3
- Dthere is no feasible solution
12The constraint that represents the quantity supplied by DC1 is
- A4x1a+6x1b+8x1c < 500
- B4x1a+6x1b+8x1c = 500
- Cx1a+x1b+x1c < 500
- Dx1a+x1b+x1c = 500
13The constraint that represents the quantity demanded by customer B is
- A6x1b+2x2b+8x3b<350
- B6x1b+2x2b+8x3b = 350
- Cx1b+x2b+x3b < 350
- Dx1b + x2b + x3b = 350
Información
- Descripción
- Bus 104 Test sobre Final Review 2, creado por Mahmoud Hemood el 09/06/2019.
- Autor
- Mahmoud Hemood
- Idioma
- English
- Visitas
- 1
- Etiquetas
- Valoración
- Aún sin valoraciones Valora este test