search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Recent questions and answers in Optimization

0 votes
1 answer
1
Consider the following linear programming (LP): $\begin{array}{ll} \text{Max.} & z=2x_1+3x_2 \\ \text{Such that} & 2x_1+x_2 \leq 4 \\ & x_1 + 2x_2 \leq 5 \\ & x_1, x_2 \geq 0 \end{array}$ The optimum value of the LP is $23$ $9.5$ $13$ $8$
answered Nov 21, 2020 in Optimization Sanjay Sharma 144 views
0 votes
0 answers
2
0 votes
1 answer
3
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
answered May 27, 2020 in Optimization Mohit Kumar 6 298 views
3 votes
3 answers
4
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
answered Aug 4, 2019 in Optimization kmittal1908 3.9k views
1 vote
1 answer
5
The initial basic feasible solution of the following transportion problem: is given as 5 8 7 2 2 10 then the minimum cost is 76 78 80 82
answered May 9, 2018 in Optimization Girjesh Chouhan 1.8k views
1 vote
2 answers
6
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is $\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$D_1$} & \textbf{$D_2$} & \text{$D_3$} & \text{$D_4$} & \textbf{Supply} \\\hline \textbf{$ ... = 180 $x_{11}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost = 180 None of the above
answered Mar 27, 2018 in Optimization Debasmita Bhoumik 2.6k views
3 votes
2 answers
7
In constraint satisfaction problem, constraints can be stated as Arithmetic equations and inequalities that bind the values of variables Arithmetic equations and inequalities that does not bind any restriction over variables Arithmetic equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
answered Aug 11, 2016 in Optimization Sanjay Sharma 955 views
3 votes
1 answer
8
Consider the following transportation problem: The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximation method is $1450$ $1465$ $1480$ $1520$
answered Aug 11, 2016 in Optimization Sanjay Sharma 3.4k views
1 vote
1 answer
9
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zero generate degenerate infeasible unbounded
answered Aug 11, 2016 in Optimization Sanjay Sharma 3.3k views
2 votes
1 answer
10
Consider the following conditions: The solution must be feasible, i.e. it must satisfy all the supply and demand constraints The number of positive allocations must be equal to $m+n-1$, where $m$ is the number of rows and $n$ is the number of columns All the positive allocations must be in independent ... solution if it satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$
answered Aug 11, 2016 in Optimization Sanjay Sharma 1.2k views
2 votes
1 answer
11
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
answered Aug 2, 2016 in Optimization Sanjay Sharma 1.3k views
3 votes
1 answer
12
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1
answered Aug 2, 2016 in Optimization Sanjay Sharma 1.7k views
2 votes
1 answer
13
2 votes
1 answer
14
The following Linear Programming problem has: $\text{Max} \quad Z=x_1+x_2$ Subject to $\quad x_1-x_2 \geq 0$ $\quad \quad \quad 3x_1 - x_2 \leq -3$ $\text{and} \quad x_1 , x_2 \geq 0 $ Feasible solution No feasible solution Unbounded solution Single point as solution
answered Jul 27, 2016 in Optimization Sanjay Sharma 1.5k views
3 votes
1 answer
15
If the primal Linear Programming problem has unbounded solution, then it's dual problem will have feasible solution alternative solution no feasible solution at all no alternative solution at all
answered Jul 27, 2016 in Optimization Sanjay Sharma 1.1k views
1 vote
1 answer
16
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? Alternate optimality Infeasibility Unboundedness All of the above
answered Jul 13, 2016 in Optimization Sanjay Sharma 1.6k views
0 votes
1 answer
17
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
answered Jul 13, 2016 in Optimization Sanjay Sharma 3.9k views
1 vote
1 answer
18
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are 6 8 10 12
answered Jul 13, 2016 in Optimization Sanjay Sharma 2.8k views
2 votes
1 answer
19
The feasible region represented by the constraints $x_1 - x_2 \leq 1, x_1 + x_2 \geq 3, x_1 \geq 0, x_2 \geq 0$ of the objective function Max $Z=3x_1 + 2x_2$ is A polygon Unbounded feasible region A point None of these
answered Jul 7, 2016 in Optimization Sanjay Sharma 1.4k views
Help get things started by asking a question.
...