Linear Programming - Graphical Method

Question 1

Who invented the technique for optimizing shipping resources?

Answer 1

American mathematicians during World War 2.

Question 2

What did George B. Dantzig develop from 1946 to 1947?

Answer 2

General linear programming formulation for planning problems in the US Air Force.

Question 3

What significant method did Dantzig invent in 1947?

Answer 3

The simplex method.

Question 4

What problem did the simplex method efficiently tackle?

Answer 4

Linear programming problem

Question 5

When was linear programming published?

Answer 5

After WW2

Question 6

Why was linear programming published after the war?

Answer 6

Due to the fear of Americans that other countries might take advantage of their method.

Question 7

Main use of linear programming today?

Answer 7

Business models.

Question 8

A method for solving problems in which a quantity is to be maximized or minimized when the quantity is subject to various restrictions or constraints.

Answer 8

Linear programming

Question 9

When do linear programming problems arise?

Answer 9

In situations where available resources are limited or cannot be utilized completely.

Question 10

When did George B. Dantzig develop general linear programming formulation

Answer 10

from 1946 to 1947

Question 11

The optimal value of a linear function which defines the objectives of the problem subject to a set of linear constraints.

Answer 11

LP problem

Question 12

The limit or decision environment of the problem.

Answer 12

Constraints

Question 13

May mean maximizing profit or minimizing cost in a specific context.

Answer 13

Optimal

Question 14

There must be a linear relationship between variables and constraints.

Answer 14

first property

Question 15

The linear programming model should have an objective function.

Answer 15

second property

Question 16

What is the third property of a linear programming model?

Answer 16

There must be structural constraints in the linear programming model.

Question 17

Non-negativity constraints must be present in the linear programming model.

Answer 17

fourth property

Question 18

There must be a _____ relationship between ____ and ____.

Answer 18

linear, variables, constraints

Question 19

The linear programming model should have an?

Answer 19

Objective function.

Question 20

There must be _______ in the linear programming model.

Answer 20

structural constraints

Question 21

________ must be present in the linear programming model.

Answer 21

Non-negativity constraints

Question 22

What are the 4 basic assumptions of a linear programming problem

Answer 22

• Proportionality
• Additivity
• Divisibility
• Certainty

Question 23

The contribution of individual variables in the
objective function is proportional to their value.

Answer 23

Proportionality

Question 24

The total value of the objective function and each
constraint is the sum of the individual contributions
from each variable.

Answer 24

Additivity

Question 25

The decision variables can take on any real
numerical values within a specified range.

Answer 25

Divisibility

Question 26

The parameters are known.

Answer 26

Certainty

Question 27

What are 2 ways of solving a linear programming problem

Answer 27

• Graphical Method
• Simplex Method

Question 28

The best used only for simple LP models involving two or three variables.

Answer 28

Graphical Method

Question 29

LP models involving several decision variables.

Answer 29

Simplex Method