Download as xlsx, pdf, or txt
Download as xlsx, pdf, or txt
You are on page 1of 8

Name VANESSA CANOOG

EDP Code 82810 20


Subject Management Science

Your Answer No
B 1

A 2

D 3

Step 1 - Identify the decision variables. S 4

DECISION VARIABLES, CONSTRAINTS, DAT 5


CONSTRAINTS, OBJECTIVE FUNCTION, LINE 6

1. Standard form, 2. Introducing slack varia 7

A 8

D 9

C 10

A 11
B 12

D 13

A 14

B 15

D 16

A 17
A 18

A 19

C 20
<< No of Items

Question
It gives the ultimate solution of the problem.
a. Objective function
b. Decision variables
c. Non-negativity
d. Linearity

Defined as the problem of maximizing or minimizing a linear function that is subjected to linear constraints.

a. Linear Optimization
b. Linearity
c. Programming
d. Linear programming

In this method, the set of inequalities are subjected to constraints.

a. Engineering
b. linear programming
c. Linearity
d. graphical method

How to Solve Linear Programming?

What are the 4 components of Linear Programming?


What are the 6 characteristics of Linear Programming?

What are the following steps to solve linear programming using the simplex method?

The word _________ in linear programming depicts the relationship between different variables.
a. Linear
b. Linearity
c. Programming
d. Linear programming

There should be finite and infinite input and output numbers


a. Constraints
b. Data
c. Non-negativity
d. Finiteness

The word ___________ in linear programming shows that the optimal solution is selected from different alternatives.
a. Linear
b. Line
c. Programming
d. Linear programming

_______ is the method of considering different inequalities relevant to a situation and calculating the best value that is require
a. Linear programming
b. Decision Variables
c. Programming
d. Objective Functions
The number of constraints should be expressed in the ____________ terms.
a. Qualitative
b. Quantitative
c. Decision Variables
d. Variables

The variable should be positive or zero and should not be a negative value
a. Decision variable
b. Variables
c. Constraints
d. Non-negativity

________is used to optimize the two-variable linear programming.


a. graphical method
b. Engineering
c. linear programming
d. Linearity

The limitations should be expressed in the mathematical form, regarding the resource.
a. Non-negativity
b. Constraints
c. Fitness
d. Decision Variable

In a problem, the objective function should be specified in a quantitative way.


a. Linear programming
b. Decision Variables
c. Programming
d. Objective Functions

The relationship between two or more variables in the function must be linear.
a. Linearity
b. Decision Variables
c. Non-negativity
d. Finiteness
It shows that the optimal solution is selected from different alternatives.
a. Programming
b. Linear programming
c. Linear
d. Line

The ___________in (lpp) linear programming problem can be applied to problems with two or more decision variables.
a. Graphical method
b. Decision variable
c. simplex method

It depicts the relationship between different variables


a. Programming
b. Linear programming
c. Linear
d. Linearity

You might also like