Examlex
Classify the following problems as to whether they are pure-integer,mixed-integer,zero-one,goal,or nonlinear programming problems.
(a)Maximize Z = 5 X1 + 6 X1 X2 + 2 X2
Subject to: 3 X1 + 2 X2 ≥ 6
X1 + X2 ≤ 8
X1,X2 ≥ 0
(b)Minimize Z = 8 X1 + 6 X2
Subject to: 4 X1 + 5 X2 ≥ 10
X1 + X2 ≤ 3
X1,X2 ≥ 0
X1,X2 = 0 or 1
(c)Maximize Z = 10 X1 + 5 X2
Subject to: 8 X1 + 10 X2 = 10
4 X1 + 6 X2 ≥ 5
X1,X2 integer
(d)Minimize Z = 8 X12 + 4 X1 X2 + 12 X22
Subject to: 6 X1 + X2 ≥ 50
X1 + X2 ≥ 40
Deposited
Referring to money that has been placed into a financial account for safekeeping or savings.
Time-Value
Refers to the concept that money available at the present time is worth more than the same amount in the future due to its potential earning capacity.
Monetary Compensation
Payment provided to employees or workers in the form of money for their services or labor.
Labor Time
The duration of time workers spend performing their duties to produce goods or provide services.
Q2: A certain firm has four different operations
Q10: A "balanced problem" exists in a transportation
Q13: Referring to Table 8-3, which of the
Q26: A constraint with positive slack or surplus
Q50: Which of the following methods tells whether
Q62: There is a 30% chance that any
Q71: The assignment problem is a special case
Q76: In the ABC analysis of inventory, the
Q80: In queuing theory, the calling population is
Q89: Managers use the network analysis of PERT