Without Satisfying the Non-Negativity Constraint, a Solution That Satisfies All

question 116

Multiple Choice

Without satisfying the non-negativity constraint, a solution that satisfies all the other constraints of a linear programming problem is called

• A) feasible.
• B) infeasible.
• C) semi-feasible.
• D) optimal.

---

Definitions:

Geegaws

Decorative trinkets or gadgets, often considered unnecessary or frivolous.

Utility Function

An illustrative model that shows the way individuals prioritize various combinations of products based on their contentment levels.

Coconuts

The large, brown, hard-shelled seeds of the coconut palm, used for food, oil, and as a source of material.

Fish

Aquatic vertebrates that live in water, breathe with gills, and typically have fins and scales.