info@clay6.com
+91-9566306857
(or)
+91-9176170648
Ask Questions, Get Answers
Menu
X
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
15 Test Series
CBSE XII
Math
JEEMAIN
Math
Physics
Chemistry
Practice Test Series
CBSE XI
Math
NEET
Physics
Chemistry
Biology - XII
Biology - XI
Olympiad class V
Math - 5 Test Series
Olympiad class VI
Math - 5 Test Series
CBSE XII Board Exam Series
BES Math
BES Physics
BES Chemistry
BES Biology
studyplans
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
15 Test Series
CBSE XII
Math
JEEMAIN
Math
Physics
Chemistry
Practice Test Series
CBSE XI
Math
NEET
Physics
Chemistry
Biology - XII
Biology - XI
Olympiad class V
Math - 5 Test Series
Olympiad class VI
Math - 5 Test Series
CBSE XII Board Exam Series
BES Math
BES Physics
BES Chemistry
BES Biology
mobile
exams
ask
sample papers
tutors
pricing
login
X
ASK
Home
>>
CBSE XII
>>
Math
>>
Linear Programming
Fill in the blank. Any point in the feasible region that gives the ____ value (maximum or minimum) of the objective function is called ____ solution.
related to an answer for:
True or False. The common region determined by all the constraints including non-negative constraints $\; x, y \geq 0$ of a linear programming problem is called the infeasible region.
cbse
class12
toolbox
concepts
ch12
math
Share
asked
Apr 16, 2013
by
balaji.thirumalai
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1 Answer
Answer: Optimal (feasible) solution: Any point in the feasible region that gives the optimal value (maximum or minimum) of the objective function is called an optimal solution.
answered
Apr 16, 2013
by
balaji.thirumalai
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. When $Z$ has an optimal value (maximum or minimum), where the variables $x$ and $y$ are subject to constraints described by linear inequalities, this optimal value must occur where in the feasible region?
Please
log in
or
register
to add a comment.
Related questions
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. Say the objective function Z has both a maximum and a minimum value on R and each of these occurs at a corner point (vertex) of R. For this to be true, R must be unbounded. True or False.
toolbox
ch12
easy
concepts
cbse
class12
math
asked
Apr 16, 2013
by
balaji.thirumalai
1
answer
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. Say $R$ is unbounded, and a maximum or a minimum value of the objective function exists. If so, where can it exist?
class12
toolbox
cbse
concepts
ch12
easy
math
asked
Apr 16, 2013
by
balaji.thirumalai
1
answer
Let $R$ be the feasible region for a linear programming problem and let $Z = ax + by$ be the objective function. When $Z$ has an optimal value (maximum or minimum), where the variables $x$ and $y$ are subject to constraints described by linear inequalities, this optimal value must occur where in the feasible region?
ch12
class12
cbse
easy
concepts
toolbox
math
asked
Apr 16, 2013
by
balaji.thirumalai
1
answer
True or False. If two corner points of the feasible region are both optimal solutions of the same type, i.e., both produce the same maximum or minimum, then any point on the line segment joining these two points is also an optimal solution of the same type.
class12
cbse
toolbox
concepts
ch12
easy
true-or-false
math
asked
Apr 16, 2013
by
balaji.thirumalai
1
answer
True or False: In a LPP, the minimum value of the objective function $Z=ax+by$ is always 0 if origin is one of the corner point of the feasible region.
cbse
class12
ch12
q44
p257
true-or-false
exemplar
sec-a
easy
math
asked
Jan 8, 2013
by
sreemathi.v
1
answer
True or False: If the feasible region for a LPP is unbounded,maximum or minimum of the objective function $Z=ax+by$ may or may not exist
cbse
class12
ch12
q42
p257
true-or-false
exemplar
sec-a
easy
math
asked
Jan 8, 2013
by
sreemathi.v
1
answer
True or False. The common region determined by all the constraints including non-negative constraints $\; x, y \geq 0$ of a linear programming problem is called the infeasible region.
class12
cbse
concepts
toolbox
ch12
easy
math
asked
Apr 16, 2013
by
balaji.thirumalai
1
answer
Ask Question
Tag:
Math
Phy
Chem
Bio
Other
SUBMIT QUESTION
►
Please Wait
Take Test
JEEMAIN Crash Practice
15 Test Series
NEET Crash Practice
15 Test Series
JEEMAIN
350+ TESTS
NEET
320+ TESTS
CBSE XI MATH
50+ TESTS
CBSE XII MATH
80+ TESTS
...
close