Which objective is commonly used in nonlinear portfolio problems when the goal is risk management?

What is a primary challenge when solving MILPs compared to pure LPs?

Which application area exemplifies using 0-1 variables to handle conditional constraints (e.g., do X only if Y is chosen)?

Which objective form is typical in a nonlinear blending (pooling) problem as discussed in Chapter 8?

Which of the following best describes the assignment problem in network terms?

In a standard transportation problem with m origins and n destinations, which statement about the decision variables x_ij is correct?

What is the role of a dummy node or dummy arc in converting real-world networks to MILP models?

Which statement best describes a 0-1 integer linear program (0-1 ILP)?

What is a corequisite constraint in MILP modeling?

Which of the following best describes a convex optimization problem?