Quantitative Modeling and Linear Programming Concepts

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/26

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards reviewing core concepts in quantitative modeling, linear programming, constraints, and network problems.

27 Terms

1
New cards

Probabilistic model

A model that uses probability because some data is uncertain.

2
New cards

Deterministic model

A model where all input values are known with certainty.

3
New cards

Redundant constraint

A constraint that does not change the feasible region, meaning the optimal solution and feasible region do not change when it is removed.

4
New cards

Alternate optimal solutions

Multiple feasible solutions that produce the same optimal objective value.

5
New cards

Unbounded linear programming problem

A problem where the objective can improve indefinitely without violating constraints.

6
New cards

Bounding an unbounded profit problem

The process of adding effective resource or production limits, such as 3X≤5003X \le 500 and 2Y≤6002Y \le 600.

7
New cards

Linear programming acceptable objective function

An objective function where variables appear only to the first power, without products between variables.

8
New cards

Problems unsolvable by linear programming

A problem with a nonlinear objective function or nonlinear constraints.

9
New cards

Transportation network model objective

The usual objective to minimize total shipping cost while satisfying supply and demand.

10
New cards

Quantitative modeling process order

The sequence consisting of: formulate the problem, solve the model, and interpret the results.

11
New cards

Slack

The unused amount of a resource in a constraint.

12
New cards

Binding constraint

A constraint that is met exactly, whose final value equals its constraint limit in a Solver report, and its slack is zero.

13
New cards

Nonbinding constraint

A constraint that has nonzero slack because some resource remains unused.

14
New cards

Feasible region

The set of all solutions that satisfy every constraint.

15
New cards

Corner points

The vertices of the feasible region where optimal solutions can occur in linear programming.

16
New cards

Objective function

The equation representing the quantity to maximize or minimize, such as profit or cost.

17
New cards

Qualitative model

A model based mainly on descriptive judgments rather than numerical measurements.

18
New cards

Quantitative model

A model that uses numerical data and mathematical relationships.

19
New cards

Transportation problem

A network problem that determines how much to ship from sources to destinations.

20
New cards

Decision variable

A controllable quantity the model determines, such as units produced or shipped.

21
New cards

Constraints

Limits or requirements that decision variables must satisfy.

22
New cards

Maximization objective

An objective to choose feasible decision-variable values that make the objective as large as possible.

23
New cards

Minimization objective

An objective to choose feasible decision-variable values that make the objective as small as possible.

24
New cards

Sensitivity analysis

Examining how changes in model inputs affect the optimal solution.

25
New cards

RHS of a constraint

The right-hand-side value representing a resource limit or required minimum.

26
New cards

Positive slack (≤\le constraint)

Indicates that the constraint is nonbinding and has unused capacity.

27
New cards

Negative net flow

An indication that there is more outgoing than incoming flow at a node under the worksheet's net-flow convention.