Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 220 views

    Optimization Question 2

    Uploaded by

    David Stuart
    This document discusses techniques for solving non-linear programming problems. It addresses topics like selecting new points based on analyzing the problem, transforming variables to solve non-linear problems, dynamic programming as a technique developed for non-linear programming solutions, the year the first non-linear programming procedure was used, maximizing or minimizing objective functions, active constraints in standard form, evolutionary algorithms using techniques from biology, differentiable cost functions referring to problems as smooth, the rank of a rectangle matrix when rows are less than columns, and how inequality constraints affect the feasible region relative to equality constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Optimization Question 2

    Uploaded by

    David Stuart
    220 views2 pages
    This document discusses techniques for solving non-linear programming problems. It addresses topics like selecting new points based on analyzing the problem, transforming variables to solve non-linear problems, dynamic programming as a technique developed for non-linear programming solutions, the year the first non-linear programming procedure was used, maximizing or minimizing objective functions, active constraints in standard form, evolutionary algorithms using techniques from biology, differentiable cost functions referring to problems as smooth, the rank of a rectangle matrix when rows are less than columns, and how inequality constraints affect the feasible region relative to equality constraints.

    Original Description:

    optimization problms

    Original Title

    optimization question 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses techniques for solving non-linear programming problems. It addresses topics like selecting new points based on analyzing the problem, transforming variables to solve non-linear problems, dynamic programming as a technique developed for non-linear programming solutions, the year the first non-linear programming procedure was used, maximizing or minimizing objective functions, active constraints in standard form, evolutionary algorithms using techniques from biology, differentiable cost functions referring to problems as smooth, the rank of a rectangle matrix when rows are less than columns, and how inequality constraints affect the feasible region relative to equality constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    220 views2 pages

    Optimization Question 2

    Uploaded by

    David Stuart
    This document discusses techniques for solving non-linear programming problems. It addresses topics like selecting new points based on analyzing the problem, transforming variables to solve non-linear problems, dynamic programming as a technique developed for non-linear programming solutions, the year the first non-linear programming procedure was used, maximizing or minimizing objective functions, active constraints in standard form, evolutionary algorithms using techniques from biology, differentiable cost functions referring to problems as smooth, the rank of a rectangle matrix when rows are less than columns, and how inequality constraints affect the feasible region relative to equality constraints.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    You are on page 1of 2

    1.

    The technique for selecting a new point depends upon _____________


    a) Scope of the problem
    b) Nature of the problem
    c) Range of the problem
    d) Analysis of the problem

    2. One of the most powerful techniques for solving non linear programming is to transform
    the _________
    a) Data
    b) Problems
    c) Materials
    d) Variables

    3. One of the techniques developed for solution of non linear programming is?
    a) Single programming
    b) Multilinear propramming
    c) Reverse programming
    d) Dynamic programming

    4. The first non linear programming procedure to be used in which year?


    a) 1950
    b) 1940
    c) 1960
    d) 1970

    5.Maximization of f(x) is equivalent to minimization of


    a. –f(x)
    b. 1/ (f(x))
    c. √ (f(x))
    d. none of the above

    6.A “≤ type” constraint expressed in the standard form is active at a design point if it has
    a. zero value
    b. more than zero value
    c. less than zero value
    d. a & c

    7.evolutionary algorithms that use techniques inspired by evolutionary biology such as

    a. inheritance,
    b. mutation, 
    c. selection, 
    d. all of above
    8.When the optimizaion problem cost functions are differentiable, the problem is referred to as
    a. rough
    b. nonsmooth
    c. smooth
    d. a & b

    9.For a rectangle matrix, when number of rows is less than number of coulmns, i.e., m <n , the rank of
    this matrix can be
    a. less than or equal m
    b. less than or equal n
    c. more than or equal m
    d. none of the above

    10.The feasible region for the inequlailty constraints with respect to equality constraints
    a. increases
    b. decreases
    c. does not change
    d. none of the above

    You might also like