Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/Computer Science/Mathematics/Page 23

SIKSHAPATH Latest Questions

priya bharti
  • 1
priya bharti
Asked: November 23, 2021In: Mathematics

Determine the optimal solution of the following NLPP by Lagrange multiplier method Optimize Z=x12-10×1+x22 -6×2+x32-4×3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0

  • 1

Determine the optimal solution of the following NLPP by Lagrange multiplier method Optimize Z=x12-10x1+x22 -6x2+x32-4x3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0

determine the optimal solution of the following nlpp by lagrange multiplier method
  • 1 Answer
  • 1k Views
Answer
amarujala
  • 0
amarujala
Asked: November 23, 2021In: Mathematics

p, q, r and s are one of the digits 1, 7, 5 or 6, with each digit used only …

  • 0

p, q, r and s are one of the digits 1, 7, 5 or 6, with each digit used only once. How many different values of p × s + r × q can be obtained? A television channel has eight ...

a television channel has eight shows a b k l m n y zp q r and s are one of the digits 1 7 5 or 6 with each digit used only onceravi has a board similar to a chessboard except that it has only 6 6 squares
  • 0 Answers
  • 324 Views
Answer
Jaysingh123
  • 1
Jaysingh123
Asked: November 23, 2021In: Mathematics

Solve the following quadratic programming problem(Wolf’s method) Maximize        Z = 2×1+x2-x12, Subject to        2×1+3×2 ≤ 6, 2×1+x2 ≤ …

  • 1
Solve the following quadratic programming problem(Wolf’s method) Maximize        Z = 2×1+x2-x12, Subject to        2×1+3×2 ≤ 6, 2×1+x2 ≤ …

Solve the following quadratic programming problem(Wolf’s method) Maximize        Z = 2x1+x2-x12, Subject to        2x1+3x2 ≤ 6, 2x1+x2 ≤ 4, x1, x2≥ 0

assignment question
  • 2 Answers
  • 1k Views
Answer
Advance Learner
  • 0
Advance Learner
Asked: November 22, 2021In: Mathematics

Evaluate the following question

  • 0

Evaluate the following question  

  • 0 Answers
  • 136 Views
Answer
Advance Learner
  • 0
Advance Learner
Asked: November 22, 2021In: Mathematics

Evaluate the following question

  • 0

Evaluate the following question  

  • 0 Answers
  • 115 Views
Answer
prabhjeet_cheema
  • 0
prabhjeet_cheema
Asked: November 22, 2021In: Mathematics

Consider following NLPP Min Z=2x₂²-24x₁+2x₂²-8x₂+2×3²-12×3+200 By separating this function show that it is convex

  • 0
Consider following NLPP Min Z=2x₂²-24x₁+2x₂²-8x₂+2×3²-12×3+200 By separating this function show that it is convex

Consider following NLPP Min Z=2x₂²-24x₁+2x₂²-8x₂+2×3²-12×3+200 By separating this function show that it is convex

  • 1 Answer
  • 410 Views
Answer
1 … 22 23 24 … 29

Sidebar

store ads

Stats

  • Questions 1k
  • Answers 1k
  • Posts 149
  • Best Answers 89
  • This Free AI Tool Translates Entire Books in Minute !
  • AI News: 🎬 Hollywood’s AI Studios, 🎓 OpenAI’s Latest Gift to Educators, 🚚 Class8 Bags $22M, 🧠 Google Gemini’s Memory Upgrade
  • AI NEWS: Legal Action Against OpenAI, $16M Paid, & Elon Musk’s Praise from Investor 🤖💰📑 | AI Boosts Cloud Seeding for Water Security 🌱💧
  • AI News: 🎬AI Video Tool Scam Exposed🤯, 🛰️ AI-Powered Drones to Ukraine 😱, Google’s $20M AI Push, Sam Altman Joins SF’s Leadership Team
  • AI News: 🤝 Biden Meets Xi on AI Talks, 💡 Xavier Niel’s Advice for Europe, ♻️ Hong Kong’s Smart Bin Revolution, 🚀 AI x Huawei

Explore

  • Recent Questions
  • Questions For You
  • Answers With Time
  • Most Visited
  • New Questions
  • Recent Questions With Time

Footer

SIKSHAPATH

Helpful Links

  • Contact
  • Disclaimer
  • Privacy Policy Notice
  • TERMS OF USE
  • FAQs
  • Refund/Cancellation Policy
  • Delivery Policy for Sikshapath

Follow Us

© 2021-24 Sikshapath. All Rights Reserved