PRE-TEST MODULE 4 (TYPE-B)

Linear Programming is a problem-solving technique by considering the constraints that exist in the problem so that an ________ is obtained

• Smallest Condition

• Optimal Condition

• Largest Condition

• Simplex Condition

There are three main elements that build linear programming, such as decision variable, ________, constrain function, and non-negative function

• Objective Function

• Minimize Function

• Maximize Function

• Simplex Function

X1 + 2X2 < 6 , is the example of _____ function.

• Objective

• Non-Negative

• Constraint

• Decision

According to ________ Linear Programming is a linear mathematical method to determine an optimal solution by maximizing or minimizing the objective function of a constraint arrangement

• Hiller and Lieberman (2015)

• Taha (2011)

• Mulyono (2017)

• Siswanto (2007)

Below this is not a step of the Hungarian method ________

• A column reduction

• Modify the table, if the number of lines is less than number of rows

• A row reduction

• Determines the maximum number of rows required to cover all numbers and determines whether the assignment model is optimal

Hungarian method is a method developed by a mathematician named ________

• Hiller and Lieberman (2015)

• Mulyono (2017)

• Siswanto (2007)

• D. Konig (1916)

There are ________ main elements that make up a linear programming

• 3

• 5

• 2

• 4

Which method is best for transportation method ________

• Least Cost Method

• Vogel's Approximation Method

• Northwest Corner Method

• Assignment Method

The procedure of ________ method is row reduction which reduces each value in the row by the smallest value on that row 

• Hungarian

• Linear Programming

• Least Cost

• Transportation

There are ____ steps in Hungarian Methods

• Three

• Six

• Five

• Four