Technical Note—Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints | Zendy

Richard E. Wendell | Zendy; Daniel Rosenblum | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Technical Note—Further Results on the Minimization of a Nonseparable Objective Function Subject to Disjoint Constraints

Author(s) -

Richard E. Wendell,

Daniel Rosenblum

Publication year - 1980

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.28.5.1222

Subject(s) - disjoint sets , constraint (computer aided design) , mathematics , class (philosophy) , minification , mathematical optimization , variable (mathematics) , function (biology) , subject (documents) , combinatorics , computer science , artificial intelligence , mathematical analysis , geometry , evolutionary biology , library science , biology

We consider the class of nonseparable mathematical programs in which the vector variable can be partitioned into a number of subvectors corresponding to independent constraint sets, as opposed to two such subvectors considered in an earlier paper by Wendell and Hurter (W-H). Several optimality conditions previously given by W-H are extended to this more general case.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research